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/real-life/PricedTimedAutomata/u2b02_multiple_pca_UNSAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:12:43,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:12:43,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:12:43,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:12:43,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:12:43,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:12:43,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:12:43,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:12:43,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:12:43,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:12:43,120 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:12:43,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:12:43,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:12:43,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:12:43,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:12:43,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:12:43,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:12:43,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:12:43,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:12:43,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:12:43,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:12:43,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:12:43,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:12:43,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:12:43,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:12:43,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:12:43,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:12:43,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:12:43,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:12:43,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:12:43,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:12:43,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:12:43,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:12:43,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:12:43,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:12:43,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:12:43,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:12:43,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:12:43,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:12:43,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:12:43,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:12:43,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:12:43,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:12:43,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:12:43,199 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:12:43,200 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:12:43,201 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b02_multiple_pca_UNSAFE.bpl [2019-08-05 10:12:43,202 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b02_multiple_pca_UNSAFE.bpl' [2019-08-05 10:12:43,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:12:43,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:12:43,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:43,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:12:43,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:12:43,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,296 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:12:43,296 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:12:43,296 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:12:43,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:43,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:12:43,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:12:43,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:12:43,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/1) ... [2019-08-05 10:12:43,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:12:43,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:12:43,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:12:43,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:12:43,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (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:12:43,439 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:12:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_x [2019-08-05 10:12:43,440 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:12:43,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:12:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:12:43,441 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_steps [2019-08-05 10:12:43,560 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:12:44,121 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:12:44,121 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 10:12:44,123 INFO L202 PluginConnector]: Adding new model u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:44 BoogieIcfgContainer [2019-08-05 10:12:44,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:12:44,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:12:44,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:12:44,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:12:44,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:43" (1/2) ... [2019-08-05 10:12:44,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354686b9 and model type u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:12:44, skipping insertion in model container [2019-08-05 10:12:44,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:44" (2/2) ... [2019-08-05 10:12:44,132 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b02_multiple_pca_UNSAFE.bpl [2019-08-05 10:12:44,142 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:12:44,150 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:12:44,168 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:12:44,195 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:12:44,196 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:12:44,196 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:12:44,197 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:12:44,197 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:12:44,197 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:12:44,197 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:12:44,197 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:12:44,198 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:12:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-08-05 10:12:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:12:44,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:44,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:12:44,223 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 1 times [2019-08-05 10:12:44,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:44,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:44,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:44,367 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:12:44,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:44,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:12:44,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:44,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:44,390 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-08-05 10:12:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:44,445 INFO L93 Difference]: Finished difference Result 19 states and 30 transitions. [2019-08-05 10:12:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:44,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:12:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:44,458 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:12:44,459 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:12:44,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:12:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:12:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:12:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-08-05 10:12:44,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 2 [2019-08-05 10:12:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:44,499 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-08-05 10:12:44,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-08-05 10:12:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:12:44,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:44,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:12:44,501 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:44,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:44,501 INFO L82 PathProgramCache]: Analyzing trace with hash 125110644, now seen corresponding path program 1 times [2019-08-05 10:12:44,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:44,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:44,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:44,569 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:12:44,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:44,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:44,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:44,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:44,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:44,574 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 3 states. [2019-08-05 10:12:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:44,670 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-08-05 10:12:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:44,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:12:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:44,688 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:12:44,688 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:12:44,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:12:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:12:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-08-05 10:12:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:12:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-08-05 10:12:44,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 5 [2019-08-05 10:12:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:44,696 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-08-05 10:12:44,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-08-05 10:12:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:12:44,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:44,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:12:44,697 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:44,698 INFO L82 PathProgramCache]: Analyzing trace with hash -416483757, now seen corresponding path program 1 times [2019-08-05 10:12:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:44,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:44,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:44,737 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:12:44,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:44,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:44,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:44,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:44,739 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 3 states. [2019-08-05 10:12:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:44,862 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-08-05 10:12:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:44,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 10:12:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:44,864 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:12:44,864 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:12:44,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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:12:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:12:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-08-05 10:12:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:12:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-08-05 10:12:44,873 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 6 [2019-08-05 10:12:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:44,873 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-08-05 10:12:44,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-08-05 10:12:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:12:44,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:44,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:44,875 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:44,876 INFO L82 PathProgramCache]: Analyzing trace with hash -26092743, now seen corresponding path program 1 times [2019-08-05 10:12:44,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:44,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:12:44,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:44,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,037 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:12:45,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:45,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:45,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:12:45,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:12:45,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:12:45,039 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2019-08-05 10:12:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:45,163 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2019-08-05 10:12:45,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:45,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:12:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:45,165 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:12:45,165 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:12:45,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:12:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:12:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:12:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2019-08-05 10:12:45,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 7 [2019-08-05 10:12:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:45,182 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2019-08-05 10:12:45,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:12:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2019-08-05 10:12:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:12:45,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:45,183 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:45,183 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash 49886986, now seen corresponding path program 1 times [2019-08-05 10:12:45,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:45,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:12:45,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:45,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:45,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:45,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:12:45,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:12:45,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:12:45,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:12:45,517 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 7 states. [2019-08-05 10:12:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:45,784 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-08-05 10:12:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:12:45,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:12:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:45,785 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:12:45,785 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:12:45,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:12:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:12:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-08-05 10:12:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:12:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2019-08-05 10:12:45,793 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 14 [2019-08-05 10:12:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:45,795 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2019-08-05 10:12:45,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:12:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2019-08-05 10:12:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:12:45,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:45,796 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:45,797 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash 533211751, now seen corresponding path program 1 times [2019-08-05 10:12:45,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:45,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:45,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:45,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:45,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:45,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:45,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:45,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:45,853 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand 3 states. [2019-08-05 10:12:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:45,889 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-08-05 10:12:45,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:45,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-08-05 10:12:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:45,890 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:12:45,890 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:12:45,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:12:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:12:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:12:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:12:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2019-08-05 10:12:45,898 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 16 [2019-08-05 10:12:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:45,898 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-08-05 10:12:45,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2019-08-05 10:12:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:12:45,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:45,899 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:45,900 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:45,900 INFO L82 PathProgramCache]: Analyzing trace with hash 850522377, now seen corresponding path program 1 times [2019-08-05 10:12:45,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:45,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:12:45,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:46,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,258 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:46,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:46,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:46,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:12:46,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:12:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:12:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:12:46,487 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand 11 states. [2019-08-05 10:12:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:46,808 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2019-08-05 10:12:46,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:12:46,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-08-05 10:12:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:46,810 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:12:46,810 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:12:46,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:12:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:12:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2019-08-05 10:12:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:12:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2019-08-05 10:12:46,830 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 25 [2019-08-05 10:12:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:46,830 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-08-05 10:12:46,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:12:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2019-08-05 10:12:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:12:46,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:46,832 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:46,832 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash -914434510, now seen corresponding path program 2 times [2019-08-05 10:12:46,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:46,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:12:46,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:46,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:47,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:47,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:12:47,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:12:47,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:12:47,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:12:47,197 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 13 states. [2019-08-05 10:12:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:47,969 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2019-08-05 10:12:47,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:12:47,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-08-05 10:12:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:47,972 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:12:47,972 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:12:47,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:12:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2019-08-05 10:12:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:12:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2019-08-05 10:12:47,983 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 31 [2019-08-05 10:12:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:47,983 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2019-08-05 10:12:47,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:12:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2019-08-05 10:12:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:12:47,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:47,986 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:47,986 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1717303098, now seen corresponding path program 3 times [2019-08-05 10:12:47,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:48,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:48,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:12:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:48,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:48,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:48,043 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand 3 states. [2019-08-05 10:12:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:48,071 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2019-08-05 10:12:48,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:48,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-08-05 10:12:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:48,073 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:12:48,073 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:12:48,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:12:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:12:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-08-05 10:12:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:12:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2019-08-05 10:12:48,081 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 32 [2019-08-05 10:12:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:48,082 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-08-05 10:12:48,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2019-08-05 10:12:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:12:48,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:48,083 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:48,084 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash 47131281, now seen corresponding path program 1 times [2019-08-05 10:12:48,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:48,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:12:48,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:48,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:48,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:48,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:12:48,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:12:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:12:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:12:48,501 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand 12 states. [2019-08-05 10:12:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:48,958 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2019-08-05 10:12:48,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:12:48,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-08-05 10:12:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:48,960 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:12:48,961 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:12:48,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:12:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2019-08-05 10:12:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:12:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2019-08-05 10:12:48,968 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 33 [2019-08-05 10:12:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:48,973 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-08-05 10:12:48,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:12:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2019-08-05 10:12:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:12:48,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:48,974 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:48,975 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:48,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1386427974, now seen corresponding path program 2 times [2019-08-05 10:12:48,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:49,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:12:49,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:49,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:49,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:49,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:12:49,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:12:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:12:49,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:12:49,259 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand 14 states. [2019-08-05 10:12:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:49,667 INFO L93 Difference]: Finished difference Result 174 states and 215 transitions. [2019-08-05 10:12:49,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:12:49,668 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-08-05 10:12:49,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:49,670 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:12:49,670 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:12:49,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:12:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:12:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 103. [2019-08-05 10:12:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:12:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2019-08-05 10:12:49,677 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 39 [2019-08-05 10:12:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:49,678 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2019-08-05 10:12:49,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:12:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2019-08-05 10:12:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:12:49,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:49,679 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:49,680 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:49,680 INFO L82 PathProgramCache]: Analyzing trace with hash 64752799, now seen corresponding path program 3 times [2019-08-05 10:12:49,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:49,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:12:49,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:49,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:50,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:50,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:12:50,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:12:50,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:12:50,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:12:50,390 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand 14 states. [2019-08-05 10:12:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:50,794 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2019-08-05 10:12:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:12:50,795 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-08-05 10:12:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:50,797 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:12:50,797 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:12:50,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:12:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:12:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2019-08-05 10:12:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:12:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2019-08-05 10:12:50,808 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 39 [2019-08-05 10:12:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:50,809 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2019-08-05 10:12:50,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:12:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2019-08-05 10:12:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:12:50,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:50,811 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:50,811 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash 733629768, now seen corresponding path program 4 times [2019-08-05 10:12:50,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:50,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:12:50,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:50,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,184 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:51,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:51,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:51,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:12:51,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:12:51,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:12:51,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:12:51,631 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand 14 states. [2019-08-05 10:12:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:52,093 INFO L93 Difference]: Finished difference Result 166 states and 198 transitions. [2019-08-05 10:12:52,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:12:52,094 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2019-08-05 10:12:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:52,096 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:12:52,096 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:12:52,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:12:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:12:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143. [2019-08-05 10:12:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:12:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2019-08-05 10:12:52,101 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 173 transitions. Word has length 41 [2019-08-05 10:12:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:52,101 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 173 transitions. [2019-08-05 10:12:52,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:12:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 173 transitions. [2019-08-05 10:12:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:12:52,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:52,104 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:12:52,104 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2039299156, now seen corresponding path program 5 times [2019-08-05 10:12:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:52,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:12:52,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:52,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:52,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:52,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:12:52,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:12:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:12:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:12:52,555 INFO L87 Difference]: Start difference. First operand 143 states and 173 transitions. Second operand 18 states. [2019-08-05 10:12:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:53,089 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2019-08-05 10:12:53,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:12:53,090 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-08-05 10:12:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:53,091 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:12:53,092 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:12:53,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:12:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:12:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2019-08-05 10:12:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:12:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2019-08-05 10:12:53,097 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 50 [2019-08-05 10:12:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:53,097 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2019-08-05 10:12:53,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:12:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2019-08-05 10:12:53,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:12:53,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:53,099 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:12:53,099 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:53,100 INFO L82 PathProgramCache]: Analyzing trace with hash -661837813, now seen corresponding path program 6 times [2019-08-05 10:12:53,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:53,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:12:53,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:53,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:53,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:53,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:12:53,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:12:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:12:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:12:53,400 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand 18 states. [2019-08-05 10:12:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:53,846 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2019-08-05 10:12:53,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:12:53,847 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-08-05 10:12:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:53,849 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:12:53,849 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:12:53,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:12:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:12:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2019-08-05 10:12:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:12:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 184 transitions. [2019-08-05 10:12:53,856 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 184 transitions. Word has length 52 [2019-08-05 10:12:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:53,856 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 184 transitions. [2019-08-05 10:12:53,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:12:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 184 transitions. [2019-08-05 10:12:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:12:53,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:53,858 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:12:53,858 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 854146365, now seen corresponding path program 7 times [2019-08-05 10:12:53,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:53,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:12:53,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:53,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:54,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:54,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:12:54,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:12:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:12:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:54,235 INFO L87 Difference]: Start difference. First operand 153 states and 184 transitions. Second operand 20 states. [2019-08-05 10:12:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:54,885 INFO L93 Difference]: Finished difference Result 221 states and 262 transitions. [2019-08-05 10:12:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:12:54,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-08-05 10:12:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:54,888 INFO L225 Difference]: With dead ends: 221 [2019-08-05 10:12:54,888 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 10:12:54,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:12:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 10:12:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2019-08-05 10:12:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:12:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 243 transitions. [2019-08-05 10:12:54,894 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 243 transitions. Word has length 56 [2019-08-05 10:12:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:54,894 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 243 transitions. [2019-08-05 10:12:54,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:12:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2019-08-05 10:12:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:12:54,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:54,896 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:12:54,896 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1067533236, now seen corresponding path program 8 times [2019-08-05 10:12:54,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:54,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:12:54,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:54,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:55,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:55,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:12:55,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:12:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:12:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:55,479 INFO L87 Difference]: Start difference. First operand 200 states and 243 transitions. Second operand 20 states. [2019-08-05 10:12:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:56,242 INFO L93 Difference]: Finished difference Result 272 states and 326 transitions. [2019-08-05 10:12:56,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:12:56,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2019-08-05 10:12:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:56,245 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:12:56,245 INFO L226 Difference]: Without dead ends: 272 [2019-08-05 10:12:56,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:12:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-08-05 10:12:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 188. [2019-08-05 10:12:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:12:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2019-08-05 10:12:56,251 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 58 [2019-08-05 10:12:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:56,252 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2019-08-05 10:12:56,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:12:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2019-08-05 10:12:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:12:56,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:56,253 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:56,253 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1153697060, now seen corresponding path program 9 times [2019-08-05 10:12:56,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:56,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:12:56,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:56,611 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:56,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:56,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:56,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:12:56,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:12:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:12:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:12:56,917 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 19 states. [2019-08-05 10:12:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:57,536 INFO L93 Difference]: Finished difference Result 224 states and 265 transitions. [2019-08-05 10:12:57,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:12:57,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-08-05 10:12:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:57,539 INFO L225 Difference]: With dead ends: 224 [2019-08-05 10:12:57,539 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:12:57,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:12:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:12:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 162. [2019-08-05 10:12:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:12:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2019-08-05 10:12:57,544 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 58 [2019-08-05 10:12:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:57,544 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2019-08-05 10:12:57,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:12:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2019-08-05 10:12:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:12:57,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:57,545 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:57,546 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -194972219, now seen corresponding path program 10 times [2019-08-05 10:12:57,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:57,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:57,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:57,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:57,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:57,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:12:57,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:12:57,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:12:57,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:57,959 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand 21 states. [2019-08-05 10:12:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:58,695 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2019-08-05 10:12:58,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:12:58,696 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-08-05 10:12:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:58,698 INFO L225 Difference]: With dead ends: 225 [2019-08-05 10:12:58,698 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 10:12:58,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:12:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 10:12:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 143. [2019-08-05 10:12:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:12:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2019-08-05 10:12:58,704 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 64 [2019-08-05 10:12:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:58,705 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2019-08-05 10:12:58,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:12:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2019-08-05 10:12:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:12:58,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:58,706 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:58,706 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:58,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:58,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1256208554, now seen corresponding path program 11 times [2019-08-05 10:12:58,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:58,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:58,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:58,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:58,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:59,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:59,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:12:59,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:12:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:12:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:59,281 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand 21 states. [2019-08-05 10:12:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:59,895 INFO L93 Difference]: Finished difference Result 239 states and 280 transitions. [2019-08-05 10:12:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:12:59,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-08-05 10:12:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:59,897 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:12:59,897 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 10:12:59,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:12:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 10:12:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2019-08-05 10:12:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 10:12:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 265 transitions. [2019-08-05 10:12:59,903 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 265 transitions. Word has length 64 [2019-08-05 10:12:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:59,904 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 265 transitions. [2019-08-05 10:12:59,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:12:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 265 transitions. [2019-08-05 10:12:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:12:59,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:59,905 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:59,905 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:59,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1509828575, now seen corresponding path program 12 times [2019-08-05 10:12:59,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:59,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:59,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:00,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:00,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:00,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:13:00,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:13:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:13:00,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:00,540 INFO L87 Difference]: Start difference. First operand 224 states and 265 transitions. Second operand 21 states. [2019-08-05 10:13:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:01,137 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2019-08-05 10:13:01,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:13:01,137 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-08-05 10:13:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:01,139 INFO L225 Difference]: With dead ends: 299 [2019-08-05 10:13:01,140 INFO L226 Difference]: Without dead ends: 299 [2019-08-05 10:13:01,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=1166, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:13:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-08-05 10:13:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 184. [2019-08-05 10:13:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:13:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 220 transitions. [2019-08-05 10:13:01,146 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 220 transitions. Word has length 66 [2019-08-05 10:13:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:01,146 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 220 transitions. [2019-08-05 10:13:01,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:13:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2019-08-05 10:13:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:13:01,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:01,147 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:13:01,148 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:01,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:01,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1033657709, now seen corresponding path program 13 times [2019-08-05 10:13:01,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:01,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:13:01,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:01,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,521 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:02,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:02,394 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:13:02,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:02,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:02,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:02,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:02,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:02,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:02,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:13:02,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:13:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:13:02,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:02,682 INFO L87 Difference]: Start difference. First operand 184 states and 220 transitions. Second operand 21 states. [2019-08-05 10:13:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:03,386 INFO L93 Difference]: Finished difference Result 224 states and 262 transitions. [2019-08-05 10:13:03,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:13:03,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-08-05 10:13:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:03,389 INFO L225 Difference]: With dead ends: 224 [2019-08-05 10:13:03,390 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:13:03,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:13:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:13:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2019-08-05 10:13:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 10:13:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2019-08-05 10:13:03,395 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 66 [2019-08-05 10:13:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:03,395 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2019-08-05 10:13:03,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:13:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2019-08-05 10:13:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:13:03,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:03,397 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:03,397 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1159179113, now seen corresponding path program 14 times [2019-08-05 10:13:03,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:03,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:13:03,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:03,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,731 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:03,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:04,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:04,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:13:04,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:13:04,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:13:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:13:04,152 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand 25 states. [2019-08-05 10:13:05,365 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 10:13:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,755 INFO L93 Difference]: Finished difference Result 294 states and 339 transitions. [2019-08-05 10:13:05,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:13:05,755 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2019-08-05 10:13:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,757 INFO L225 Difference]: With dead ends: 294 [2019-08-05 10:13:05,757 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 10:13:05,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:13:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 10:13:05,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 274. [2019-08-05 10:13:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 10:13:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 319 transitions. [2019-08-05 10:13:05,775 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 319 transitions. Word has length 75 [2019-08-05 10:13:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,775 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 319 transitions. [2019-08-05 10:13:05,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:13:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 319 transitions. [2019-08-05 10:13:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:13:05,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,777 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:05,777 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1151372178, now seen corresponding path program 15 times [2019-08-05 10:13:05,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:13:06,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:13:06,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:13:06,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:13:06,210 INFO L87 Difference]: Start difference. First operand 274 states and 319 transitions. Second operand 25 states. [2019-08-05 10:13:06,906 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 10:13:08,184 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-08-05 10:13:09,164 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:13:09,652 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 10:13:10,388 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 10:13:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:11,473 INFO L93 Difference]: Finished difference Result 333 states and 381 transitions. [2019-08-05 10:13:11,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:13:11,474 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-08-05 10:13:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:11,476 INFO L225 Difference]: With dead ends: 333 [2019-08-05 10:13:11,476 INFO L226 Difference]: Without dead ends: 333 [2019-08-05 10:13:11,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=440, Invalid=1630, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:13:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-08-05 10:13:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 198. [2019-08-05 10:13:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 10:13:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 233 transitions. [2019-08-05 10:13:11,482 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 233 transitions. Word has length 77 [2019-08-05 10:13:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:11,483 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 233 transitions. [2019-08-05 10:13:11,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:13:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 233 transitions. [2019-08-05 10:13:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:13:11,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:11,484 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:11,484 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash -348641824, now seen corresponding path program 16 times [2019-08-05 10:13:11,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:11,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:13:11,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:11,845 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:12,417 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:12,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:12,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:12,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:13:12,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:13:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:13:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:13:12,891 INFO L87 Difference]: Start difference. First operand 198 states and 233 transitions. Second operand 25 states. [2019-08-05 10:13:13,878 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-08-05 10:13:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:14,025 INFO L93 Difference]: Finished difference Result 253 states and 293 transitions. [2019-08-05 10:13:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:13:14,025 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-08-05 10:13:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:14,027 INFO L225 Difference]: With dead ends: 253 [2019-08-05 10:13:14,027 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 10:13:14,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:13:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 10:13:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 193. [2019-08-05 10:13:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:13:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 228 transitions. [2019-08-05 10:13:14,032 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 228 transitions. Word has length 77 [2019-08-05 10:13:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:14,032 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 228 transitions. [2019-08-05 10:13:14,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:13:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 228 transitions. [2019-08-05 10:13:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:13:14,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:14,033 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:14,033 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -645445486, now seen corresponding path program 17 times [2019-08-05 10:13:14,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:14,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:13:14,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:14,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,831 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:14,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 269 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:15,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:15,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:15,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:15,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:15,014 INFO L87 Difference]: Start difference. First operand 193 states and 228 transitions. Second operand 27 states. [2019-08-05 10:13:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:16,087 INFO L93 Difference]: Finished difference Result 347 states and 402 transitions. [2019-08-05 10:13:16,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:13:16,088 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2019-08-05 10:13:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:16,090 INFO L225 Difference]: With dead ends: 347 [2019-08-05 10:13:16,090 INFO L226 Difference]: Without dead ends: 347 [2019-08-05 10:13:16,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=544, Invalid=2006, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:13:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-08-05 10:13:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 316. [2019-08-05 10:13:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 10:13:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 373 transitions. [2019-08-05 10:13:16,097 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 373 transitions. Word has length 81 [2019-08-05 10:13:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:16,098 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 373 transitions. [2019-08-05 10:13:16,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 373 transitions. [2019-08-05 10:13:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:13:16,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:16,099 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:16,099 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:16,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash -3693061, now seen corresponding path program 18 times [2019-08-05 10:13:16,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:16,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:13:16,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:16,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,699 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:16,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:17,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:17,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:17,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:17,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:17,025 INFO L87 Difference]: Start difference. First operand 316 states and 373 transitions. Second operand 27 states. [2019-08-05 10:13:18,666 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-08-05 10:13:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:19,262 INFO L93 Difference]: Finished difference Result 420 states and 489 transitions. [2019-08-05 10:13:19,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:13:19,262 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2019-08-05 10:13:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:19,265 INFO L225 Difference]: With dead ends: 420 [2019-08-05 10:13:19,265 INFO L226 Difference]: Without dead ends: 420 [2019-08-05 10:13:19,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=545, Invalid=2107, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:13:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-08-05 10:13:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 240. [2019-08-05 10:13:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-08-05 10:13:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 287 transitions. [2019-08-05 10:13:19,271 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 287 transitions. Word has length 83 [2019-08-05 10:13:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:19,271 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 287 transitions. [2019-08-05 10:13:19,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 287 transitions. [2019-08-05 10:13:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:13:19,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:19,273 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:19,273 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:19,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:19,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1226191415, now seen corresponding path program 19 times [2019-08-05 10:13:19,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:19,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:13:19,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:19,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:19,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:19,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:19,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:19,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:19,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:19,825 INFO L87 Difference]: Start difference. First operand 240 states and 287 transitions. Second operand 27 states. [2019-08-05 10:13:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:20,838 INFO L93 Difference]: Finished difference Result 330 states and 390 transitions. [2019-08-05 10:13:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:13:20,839 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2019-08-05 10:13:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:20,840 INFO L225 Difference]: With dead ends: 330 [2019-08-05 10:13:20,840 INFO L226 Difference]: Without dead ends: 330 [2019-08-05 10:13:20,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:13:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-08-05 10:13:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 228. [2019-08-05 10:13:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 10:13:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 274 transitions. [2019-08-05 10:13:20,845 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 274 transitions. Word has length 83 [2019-08-05 10:13:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:20,846 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 274 transitions. [2019-08-05 10:13:20,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 274 transitions. [2019-08-05 10:13:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:13:20,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:20,847 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:20,847 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:20,847 INFO L82 PathProgramCache]: Analyzing trace with hash 847545585, now seen corresponding path program 20 times [2019-08-05 10:13:20,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:20,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:13:20,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:21,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:21,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:21,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:13:21,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:13:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:13:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:21,300 INFO L87 Difference]: Start difference. First operand 228 states and 274 transitions. Second operand 26 states. [2019-08-05 10:13:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:22,185 INFO L93 Difference]: Finished difference Result 282 states and 329 transitions. [2019-08-05 10:13:22,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:13:22,186 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2019-08-05 10:13:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:22,188 INFO L225 Difference]: With dead ends: 282 [2019-08-05 10:13:22,188 INFO L226 Difference]: Without dead ends: 282 [2019-08-05 10:13:22,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=459, Invalid=1893, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:13:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-08-05 10:13:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 202. [2019-08-05 10:13:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:13:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 240 transitions. [2019-08-05 10:13:22,193 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 240 transitions. Word has length 83 [2019-08-05 10:13:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:22,194 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 240 transitions. [2019-08-05 10:13:22,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:13:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 240 transitions. [2019-08-05 10:13:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:13:22,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:22,195 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:22,195 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:22,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:22,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1216142362, now seen corresponding path program 21 times [2019-08-05 10:13:22,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:22,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:22,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:22,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,517 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:22,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:22,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:22,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:22,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:22,870 INFO L87 Difference]: Start difference. First operand 202 states and 240 transitions. Second operand 28 states. [2019-08-05 10:13:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:24,011 INFO L93 Difference]: Finished difference Result 283 states and 334 transitions. [2019-08-05 10:13:24,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:13:24,011 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 89 [2019-08-05 10:13:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:24,013 INFO L225 Difference]: With dead ends: 283 [2019-08-05 10:13:24,013 INFO L226 Difference]: Without dead ends: 283 [2019-08-05 10:13:24,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:13:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-08-05 10:13:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 183. [2019-08-05 10:13:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 10:13:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 218 transitions. [2019-08-05 10:13:24,019 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 218 transitions. Word has length 89 [2019-08-05 10:13:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:24,020 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 218 transitions. [2019-08-05 10:13:24,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 218 transitions. [2019-08-05 10:13:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:13:24,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:24,021 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:24,021 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1627644161, now seen corresponding path program 22 times [2019-08-05 10:13:24,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:24,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:24,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:24,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:24,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:24,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:24,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:24,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:24,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:24,591 INFO L87 Difference]: Start difference. First operand 183 states and 218 transitions. Second operand 28 states. [2019-08-05 10:13:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,502 INFO L93 Difference]: Finished difference Result 331 states and 381 transitions. [2019-08-05 10:13:25,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:25,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 89 [2019-08-05 10:13:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,505 INFO L225 Difference]: With dead ends: 331 [2019-08-05 10:13:25,505 INFO L226 Difference]: Without dead ends: 331 [2019-08-05 10:13:25,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:13:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-08-05 10:13:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 306. [2019-08-05 10:13:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-08-05 10:13:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 356 transitions. [2019-08-05 10:13:25,511 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 356 transitions. Word has length 89 [2019-08-05 10:13:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,511 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 356 transitions. [2019-08-05 10:13:25,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 356 transitions. [2019-08-05 10:13:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:13:25,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,513 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:25,513 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,513 INFO L82 PathProgramCache]: Analyzing trace with hash 832635752, now seen corresponding path program 23 times [2019-08-05 10:13:25,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:25,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:26,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:26,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:26,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:26,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:26,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:26,402 INFO L87 Difference]: Start difference. First operand 306 states and 356 transitions. Second operand 28 states. [2019-08-05 10:13:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,364 INFO L93 Difference]: Finished difference Result 438 states and 500 transitions. [2019-08-05 10:13:27,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:27,364 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-08-05 10:13:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,367 INFO L225 Difference]: With dead ends: 438 [2019-08-05 10:13:27,367 INFO L226 Difference]: Without dead ends: 438 [2019-08-05 10:13:27,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=579, Invalid=2283, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:13:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-08-05 10:13:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 264. [2019-08-05 10:13:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-08-05 10:13:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 309 transitions. [2019-08-05 10:13:27,374 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 309 transitions. Word has length 91 [2019-08-05 10:13:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,374 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 309 transitions. [2019-08-05 10:13:27,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 309 transitions. [2019-08-05 10:13:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:13:27,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,375 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:27,376 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1656585526, now seen corresponding path program 24 times [2019-08-05 10:13:27,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:27,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:27,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:27,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:27,933 INFO L87 Difference]: Start difference. First operand 264 states and 309 transitions. Second operand 28 states. [2019-08-05 10:13:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,914 INFO L93 Difference]: Finished difference Result 357 states and 411 transitions. [2019-08-05 10:13:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:13:28,914 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-08-05 10:13:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,916 INFO L225 Difference]: With dead ends: 357 [2019-08-05 10:13:28,917 INFO L226 Difference]: Without dead ends: 357 [2019-08-05 10:13:28,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=565, Invalid=2297, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:13:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-08-05 10:13:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 224. [2019-08-05 10:13:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 10:13:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 264 transitions. [2019-08-05 10:13:28,922 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 264 transitions. Word has length 91 [2019-08-05 10:13:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,923 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 264 transitions. [2019-08-05 10:13:28,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 264 transitions. [2019-08-05 10:13:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:13:28,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,924 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:28,924 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2132756392, now seen corresponding path program 25 times [2019-08-05 10:13:28,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:28,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:28,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,253 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:29,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:29,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:29,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:29,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:29,607 INFO L87 Difference]: Start difference. First operand 224 states and 264 transitions. Second operand 28 states. [2019-08-05 10:13:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:30,581 INFO L93 Difference]: Finished difference Result 282 states and 326 transitions. [2019-08-05 10:13:30,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:13:30,581 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-08-05 10:13:30,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:30,583 INFO L225 Difference]: With dead ends: 282 [2019-08-05 10:13:30,583 INFO L226 Difference]: Without dead ends: 282 [2019-08-05 10:13:30,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:13:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-08-05 10:13:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 223. [2019-08-05 10:13:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 10:13:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 261 transitions. [2019-08-05 10:13:30,587 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 261 transitions. Word has length 91 [2019-08-05 10:13:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:30,587 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 261 transitions. [2019-08-05 10:13:30,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 261 transitions. [2019-08-05 10:13:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:13:30,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:30,588 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:30,588 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash 179039732, now seen corresponding path program 26 times [2019-08-05 10:13:30,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:30,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:13:30,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:30,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,955 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:31,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:31,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:31,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:31,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:31,511 INFO L87 Difference]: Start difference. First operand 223 states and 261 transitions. Second operand 32 states. [2019-08-05 10:13:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,560 INFO L93 Difference]: Finished difference Result 398 states and 453 transitions. [2019-08-05 10:13:32,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:13:32,560 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2019-08-05 10:13:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:32,563 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:13:32,563 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:13:32,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=742, Invalid=2798, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:13:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:13:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 356. [2019-08-05 10:13:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-08-05 10:13:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 410 transitions. [2019-08-05 10:13:32,569 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 410 transitions. Word has length 100 [2019-08-05 10:13:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:32,570 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 410 transitions. [2019-08-05 10:13:32,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 410 transitions. [2019-08-05 10:13:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:13:32,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:32,571 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:32,571 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2001904149, now seen corresponding path program 27 times [2019-08-05 10:13:32,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:32,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:13:32,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:32,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,917 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:33,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:33,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:33,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:33,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:33,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:33,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:33,523 INFO L87 Difference]: Start difference. First operand 356 states and 410 transitions. Second operand 32 states. [2019-08-05 10:13:34,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:34,610 INFO L93 Difference]: Finished difference Result 508 states and 575 transitions. [2019-08-05 10:13:34,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:13:34,611 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-08-05 10:13:34,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:34,614 INFO L225 Difference]: With dead ends: 508 [2019-08-05 10:13:34,614 INFO L226 Difference]: Without dead ends: 508 [2019-08-05 10:13:34,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=744, Invalid=2916, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:13:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-08-05 10:13:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 314. [2019-08-05 10:13:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-08-05 10:13:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 363 transitions. [2019-08-05 10:13:34,621 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 363 transitions. Word has length 102 [2019-08-05 10:13:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:34,621 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 363 transitions. [2019-08-05 10:13:34,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 363 transitions. [2019-08-05 10:13:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:13:34,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:34,622 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:34,623 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:34,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:34,623 INFO L82 PathProgramCache]: Analyzing trace with hash -164735139, now seen corresponding path program 28 times [2019-08-05 10:13:34,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:34,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:13:34,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:34,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:35,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:35,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:35,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:35,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:35,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:35,338 INFO L87 Difference]: Start difference. First operand 314 states and 363 transitions. Second operand 32 states. [2019-08-05 10:13:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:36,595 INFO L93 Difference]: Finished difference Result 391 states and 445 transitions. [2019-08-05 10:13:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:13:36,595 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-08-05 10:13:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:36,597 INFO L225 Difference]: With dead ends: 391 [2019-08-05 10:13:36,597 INFO L226 Difference]: Without dead ends: 391 [2019-08-05 10:13:36,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=730, Invalid=2930, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:13:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-08-05 10:13:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 238. [2019-08-05 10:13:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 10:13:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2019-08-05 10:13:36,602 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 102 [2019-08-05 10:13:36,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:36,602 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2019-08-05 10:13:36,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2019-08-05 10:13:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:13:36,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:36,603 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:36,604 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1664749141, now seen corresponding path program 29 times [2019-08-05 10:13:36,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:36,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:13:36,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:36,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:37,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:37,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:37,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:37,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:37,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:37,172 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand 32 states. [2019-08-05 10:13:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:38,240 INFO L93 Difference]: Finished difference Result 311 states and 357 transitions. [2019-08-05 10:13:38,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:38,240 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-08-05 10:13:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:38,242 INFO L225 Difference]: With dead ends: 311 [2019-08-05 10:13:38,242 INFO L226 Difference]: Without dead ends: 311 [2019-08-05 10:13:38,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=686, Invalid=2854, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:13:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-08-05 10:13:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 233. [2019-08-05 10:13:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:13:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 272 transitions. [2019-08-05 10:13:38,247 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 272 transitions. Word has length 102 [2019-08-05 10:13:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:38,247 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 272 transitions. [2019-08-05 10:13:38,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 272 transitions. [2019-08-05 10:13:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:13:38,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:38,248 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:38,249 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash 878982877, now seen corresponding path program 30 times [2019-08-05 10:13:38,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:38,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:38,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:38,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:38,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:38,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:38,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:38,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:38,811 INFO L87 Difference]: Start difference. First operand 233 states and 272 transitions. Second operand 34 states. [2019-08-05 10:13:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:39,997 INFO L93 Difference]: Finished difference Result 487 states and 556 transitions. [2019-08-05 10:13:39,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:13:39,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2019-08-05 10:13:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:40,000 INFO L225 Difference]: With dead ends: 487 [2019-08-05 10:13:40,000 INFO L226 Difference]: Without dead ends: 487 [2019-08-05 10:13:40,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=887, Invalid=3403, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:13:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-08-05 10:13:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 398. [2019-08-05 10:13:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-08-05 10:13:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 464 transitions. [2019-08-05 10:13:40,006 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 464 transitions. Word has length 106 [2019-08-05 10:13:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:40,006 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 464 transitions. [2019-08-05 10:13:40,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 464 transitions. [2019-08-05 10:13:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:13:40,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:40,008 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:40,008 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1266258324, now seen corresponding path program 31 times [2019-08-05 10:13:40,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:40,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:40,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:40,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,368 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:40,955 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:41,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:41,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:41,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:41,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:41,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:41,758 INFO L87 Difference]: Start difference. First operand 398 states and 464 transitions. Second operand 34 states. [2019-08-05 10:13:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:43,012 INFO L93 Difference]: Finished difference Result 595 states and 683 transitions. [2019-08-05 10:13:43,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:13:43,013 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2019-08-05 10:13:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:43,016 INFO L225 Difference]: With dead ends: 595 [2019-08-05 10:13:43,016 INFO L226 Difference]: Without dead ends: 595 [2019-08-05 10:13:43,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=889, Invalid=3533, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:13:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-08-05 10:13:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 356. [2019-08-05 10:13:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-08-05 10:13:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 417 transitions. [2019-08-05 10:13:43,021 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 417 transitions. Word has length 108 [2019-08-05 10:13:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:43,021 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 417 transitions. [2019-08-05 10:13:43,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 417 transitions. [2019-08-05 10:13:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:13:43,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:43,022 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:43,022 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:43,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:43,022 INFO L82 PathProgramCache]: Analyzing trace with hash 388115846, now seen corresponding path program 32 times [2019-08-05 10:13:43,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:43,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:43,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:43,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:43,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:43,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:43,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:43,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:43,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:43,579 INFO L87 Difference]: Start difference. First operand 356 states and 417 transitions. Second operand 34 states. [2019-08-05 10:13:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:44,849 INFO L93 Difference]: Finished difference Result 478 states and 553 transitions. [2019-08-05 10:13:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:13:44,850 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2019-08-05 10:13:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:44,852 INFO L225 Difference]: With dead ends: 478 [2019-08-05 10:13:44,852 INFO L226 Difference]: Without dead ends: 478 [2019-08-05 10:13:44,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=867, Invalid=3555, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:13:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-08-05 10:13:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 280. [2019-08-05 10:13:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 10:13:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 331 transitions. [2019-08-05 10:13:44,858 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 331 transitions. Word has length 108 [2019-08-05 10:13:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:44,858 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 331 transitions. [2019-08-05 10:13:44,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 331 transitions. [2019-08-05 10:13:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:13:44,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:44,867 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:44,867 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:44,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash -834382508, now seen corresponding path program 33 times [2019-08-05 10:13:44,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:44,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:44,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:44,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:45,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:45,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:45,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:45,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:45,426 INFO L87 Difference]: Start difference. First operand 280 states and 331 transitions. Second operand 34 states. [2019-08-05 10:13:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:46,887 INFO L93 Difference]: Finished difference Result 388 states and 454 transitions. [2019-08-05 10:13:46,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:13:46,894 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2019-08-05 10:13:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:46,896 INFO L225 Difference]: With dead ends: 388 [2019-08-05 10:13:46,896 INFO L226 Difference]: Without dead ends: 388 [2019-08-05 10:13:46,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=800, Invalid=3360, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:13:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-08-05 10:13:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 268. [2019-08-05 10:13:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 10:13:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 318 transitions. [2019-08-05 10:13:46,901 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 318 transitions. Word has length 108 [2019-08-05 10:13:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:46,901 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 318 transitions. [2019-08-05 10:13:46,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 318 transitions. [2019-08-05 10:13:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:13:46,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:46,902 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:46,903 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1239354492, now seen corresponding path program 34 times [2019-08-05 10:13:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:46,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:13:46,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:47,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:47,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:47,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:13:47,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:13:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:13:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:13:47,459 INFO L87 Difference]: Start difference. First operand 268 states and 318 transitions. Second operand 33 states. [2019-08-05 10:13:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:48,725 INFO L93 Difference]: Finished difference Result 340 states and 393 transitions. [2019-08-05 10:13:48,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:13:48,725 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 108 [2019-08-05 10:13:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:48,728 INFO L225 Difference]: With dead ends: 340 [2019-08-05 10:13:48,728 INFO L226 Difference]: Without dead ends: 340 [2019-08-05 10:13:48,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=748, Invalid=3284, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:13:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-08-05 10:13:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 242. [2019-08-05 10:13:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 10:13:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2019-08-05 10:13:48,733 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 108 [2019-08-05 10:13:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:48,733 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2019-08-05 10:13:48,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:13:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2019-08-05 10:13:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:13:48,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:48,735 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 8, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:48,735 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash 379080549, now seen corresponding path program 35 times [2019-08-05 10:13:48,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:48,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:48,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:48,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:49,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:49,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:49,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:49,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:49,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:49,418 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand 35 states. [2019-08-05 10:13:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:50,757 INFO L93 Difference]: Finished difference Result 341 states and 398 transitions. [2019-08-05 10:13:50,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:13:50,758 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 114 [2019-08-05 10:13:50,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:50,760 INFO L225 Difference]: With dead ends: 341 [2019-08-05 10:13:50,760 INFO L226 Difference]: Without dead ends: 341 [2019-08-05 10:13:50,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=832, Invalid=3724, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:13:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-08-05 10:13:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 223. [2019-08-05 10:13:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 10:13:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 262 transitions. [2019-08-05 10:13:50,766 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 262 transitions. Word has length 114 [2019-08-05 10:13:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:50,766 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 262 transitions. [2019-08-05 10:13:50,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 262 transitions. [2019-08-05 10:13:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:13:50,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:50,767 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 8, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:50,768 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1830261322, now seen corresponding path program 36 times [2019-08-05 10:13:50,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:50,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:50,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:50,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:51,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:51,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:51,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:51,840 INFO L87 Difference]: Start difference. First operand 223 states and 262 transitions. Second operand 35 states. [2019-08-05 10:13:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:53,053 INFO L93 Difference]: Finished difference Result 472 states and 536 transitions. [2019-08-05 10:13:53,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:13:53,053 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 114 [2019-08-05 10:13:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:53,055 INFO L225 Difference]: With dead ends: 472 [2019-08-05 10:13:53,056 INFO L226 Difference]: Without dead ends: 472 [2019-08-05 10:13:53,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=929, Invalid=3627, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:13:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-08-05 10:13:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 388. [2019-08-05 10:13:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-05 10:13:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 447 transitions. [2019-08-05 10:13:53,062 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 447 transitions. Word has length 114 [2019-08-05 10:13:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:53,062 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 447 transitions. [2019-08-05 10:13:53,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 447 transitions. [2019-08-05 10:13:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:13:53,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:53,064 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:53,064 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:53,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1424079359, now seen corresponding path program 37 times [2019-08-05 10:13:53,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:53,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:53,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:53,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:53,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:53,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:53,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:53,672 INFO L87 Difference]: Start difference. First operand 388 states and 447 transitions. Second operand 35 states. [2019-08-05 10:13:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:55,023 INFO L93 Difference]: Finished difference Result 579 states and 655 transitions. [2019-08-05 10:13:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:13:55,024 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-08-05 10:13:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:55,026 INFO L225 Difference]: With dead ends: 579 [2019-08-05 10:13:55,027 INFO L226 Difference]: Without dead ends: 579 [2019-08-05 10:13:55,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=931, Invalid=3761, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:13:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-08-05 10:13:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 346. [2019-08-05 10:13:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-08-05 10:13:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 400 transitions. [2019-08-05 10:13:55,031 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 400 transitions. Word has length 116 [2019-08-05 10:13:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:55,031 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 400 transitions. [2019-08-05 10:13:55,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 400 transitions. [2019-08-05 10:13:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:13:55,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:55,032 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:55,032 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash -424882189, now seen corresponding path program 38 times [2019-08-05 10:13:55,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:55,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:55,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:55,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:55,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:55,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:55,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:55,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:55,616 INFO L87 Difference]: Start difference. First operand 346 states and 400 transitions. Second operand 35 states. [2019-08-05 10:13:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:56,989 INFO L93 Difference]: Finished difference Result 496 states and 564 transitions. [2019-08-05 10:13:56,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:13:56,990 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-08-05 10:13:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:56,992 INFO L225 Difference]: With dead ends: 496 [2019-08-05 10:13:56,993 INFO L226 Difference]: Without dead ends: 496 [2019-08-05 10:13:56,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=909, Invalid=3783, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:13:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-08-05 10:13:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 304. [2019-08-05 10:13:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 10:13:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 353 transitions. [2019-08-05 10:13:56,998 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 353 transitions. Word has length 116 [2019-08-05 10:13:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:56,998 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 353 transitions. [2019-08-05 10:13:56,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 353 transitions. [2019-08-05 10:13:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:13:56,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:56,999 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:56,999 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 399067585, now seen corresponding path program 39 times [2019-08-05 10:13:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:57,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:57,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:57,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:57,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:57,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:57,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:57,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:57,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:57,781 INFO L87 Difference]: Start difference. First operand 304 states and 353 transitions. Second operand 35 states. [2019-08-05 10:13:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:59,087 INFO L93 Difference]: Finished difference Result 415 states and 475 transitions. [2019-08-05 10:13:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:13:59,088 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-08-05 10:13:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:59,090 INFO L225 Difference]: With dead ends: 415 [2019-08-05 10:13:59,090 INFO L226 Difference]: Without dead ends: 415 [2019-08-05 10:13:59,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=885, Invalid=3807, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:13:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-08-05 10:13:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 264. [2019-08-05 10:13:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-08-05 10:13:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 308 transitions. [2019-08-05 10:13:59,095 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 308 transitions. Word has length 116 [2019-08-05 10:13:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:59,095 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 308 transitions. [2019-08-05 10:13:59,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 308 transitions. [2019-08-05 10:13:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:13:59,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:59,096 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:59,096 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:59,096 INFO L82 PathProgramCache]: Analyzing trace with hash 875238451, now seen corresponding path program 40 times [2019-08-05 10:13:59,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:59,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:59,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:59,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:59,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:59,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:59,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:59,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:59,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:59,724 INFO L87 Difference]: Start difference. First operand 264 states and 308 transitions. Second operand 35 states. [2019-08-05 10:14:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:01,123 INFO L93 Difference]: Finished difference Result 340 states and 390 transitions. [2019-08-05 10:14:01,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:14:01,123 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-08-05 10:14:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:01,125 INFO L225 Difference]: With dead ends: 340 [2019-08-05 10:14:01,125 INFO L226 Difference]: Without dead ends: 340 [2019-08-05 10:14:01,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=832, Invalid=3724, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:14:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-08-05 10:14:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 263. [2019-08-05 10:14:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-08-05 10:14:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2019-08-05 10:14:01,131 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 116 [2019-08-05 10:14:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:01,131 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2019-08-05 10:14:01,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:14:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2019-08-05 10:14:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:14:01,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:01,132 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 9, 9, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:01,132 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash -66712119, now seen corresponding path program 41 times [2019-08-05 10:14:01,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:01,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:14:01,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:01,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:01,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:01,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:01,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:01,859 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:14:02,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,553 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:14:02,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,323 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-08-05 10:14:04,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:04,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:04,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:14:04,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:14:04,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:14:04,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:14:04,442 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand 39 states. [2019-08-05 10:14:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:05,868 INFO L93 Difference]: Finished difference Result 542 states and 611 transitions. [2019-08-05 10:14:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:14:05,868 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 125 [2019-08-05 10:14:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:05,871 INFO L225 Difference]: With dead ends: 542 [2019-08-05 10:14:05,871 INFO L226 Difference]: Without dead ends: 542 [2019-08-05 10:14:05,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1134, Invalid=4416, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:14:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-08-05 10:14:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 438. [2019-08-05 10:14:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-08-05 10:14:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 501 transitions. [2019-08-05 10:14:05,877 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 501 transitions. Word has length 125 [2019-08-05 10:14:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:05,877 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 501 transitions. [2019-08-05 10:14:05,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 501 transitions. [2019-08-05 10:14:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:14:05,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:05,878 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:05,879 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1797344846, now seen corresponding path program 42 times [2019-08-05 10:14:05,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:05,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:14:05,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:06,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:06,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:06,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:14:06,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:14:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:14:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:14:06,869 INFO L87 Difference]: Start difference. First operand 438 states and 501 transitions. Second operand 39 states. [2019-08-05 10:14:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:08,449 INFO L93 Difference]: Finished difference Result 661 states and 743 transitions. [2019-08-05 10:14:08,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:14:08,449 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-08-05 10:14:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:08,453 INFO L225 Difference]: With dead ends: 661 [2019-08-05 10:14:08,454 INFO L226 Difference]: Without dead ends: 661 [2019-08-05 10:14:08,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1137, Invalid=4563, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:14:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-08-05 10:14:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 396. [2019-08-05 10:14:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-08-05 10:14:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 454 transitions. [2019-08-05 10:14:08,461 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 454 transitions. Word has length 127 [2019-08-05 10:14:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:08,462 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 454 transitions. [2019-08-05 10:14:08,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 454 transitions. [2019-08-05 10:14:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:14:08,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:08,463 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:08,463 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:08,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1946231680, now seen corresponding path program 43 times [2019-08-05 10:14:08,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:08,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:14:08,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:08,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:09,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:09,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:14:09,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:14:09,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:14:09,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:14:09,295 INFO L87 Difference]: Start difference. First operand 396 states and 454 transitions. Second operand 39 states. [2019-08-05 10:14:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:10,802 INFO L93 Difference]: Finished difference Result 566 states and 639 transitions. [2019-08-05 10:14:10,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:14:10,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-08-05 10:14:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:10,805 INFO L225 Difference]: With dead ends: 566 [2019-08-05 10:14:10,805 INFO L226 Difference]: Without dead ends: 566 [2019-08-05 10:14:10,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1115, Invalid=4585, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:14:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-08-05 10:14:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 354. [2019-08-05 10:14:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-08-05 10:14:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 407 transitions. [2019-08-05 10:14:10,810 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 407 transitions. Word has length 127 [2019-08-05 10:14:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:10,811 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 407 transitions. [2019-08-05 10:14:10,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 407 transitions. [2019-08-05 10:14:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:14:10,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:10,812 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:10,812 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash -109062670, now seen corresponding path program 44 times [2019-08-05 10:14:10,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:10,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:14:10,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:10,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:11,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:11,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:14:11,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:14:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:14:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:14:11,537 INFO L87 Difference]: Start difference. First operand 354 states and 407 transitions. Second operand 39 states. [2019-08-05 10:14:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:13,213 INFO L93 Difference]: Finished difference Result 449 states and 509 transitions. [2019-08-05 10:14:13,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:14:13,213 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-08-05 10:14:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:13,215 INFO L225 Difference]: With dead ends: 449 [2019-08-05 10:14:13,216 INFO L226 Difference]: Without dead ends: 449 [2019-08-05 10:14:13,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1091, Invalid=4609, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:14:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-08-05 10:14:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 278. [2019-08-05 10:14:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-08-05 10:14:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 321 transitions. [2019-08-05 10:14:13,221 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 321 transitions. Word has length 127 [2019-08-05 10:14:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:13,221 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 321 transitions. [2019-08-05 10:14:13,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 321 transitions. [2019-08-05 10:14:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:14:13,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:13,222 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:13,222 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1609076672, now seen corresponding path program 45 times [2019-08-05 10:14:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:13,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:14:13,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:13,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:14,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:14,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:14:14,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:14:14,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:14:14,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:14:14,010 INFO L87 Difference]: Start difference. First operand 278 states and 321 transitions. Second operand 39 states. [2019-08-05 10:14:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:15,579 INFO L93 Difference]: Finished difference Result 369 states and 421 transitions. [2019-08-05 10:14:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:14:15,580 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-08-05 10:14:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:15,582 INFO L225 Difference]: With dead ends: 369 [2019-08-05 10:14:15,582 INFO L226 Difference]: Without dead ends: 369 [2019-08-05 10:14:15,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1035, Invalid=4515, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:14:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-08-05 10:14:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 273. [2019-08-05 10:14:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:14:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 316 transitions. [2019-08-05 10:14:15,586 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 316 transitions. Word has length 127 [2019-08-05 10:14:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:15,586 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 316 transitions. [2019-08-05 10:14:15,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 316 transitions. [2019-08-05 10:14:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:14:15,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:15,587 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:15,587 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:15,587 INFO L82 PathProgramCache]: Analyzing trace with hash 519725810, now seen corresponding path program 46 times [2019-08-05 10:14:15,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:15,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:15,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:15,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,943 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:14:16,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:16,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:16,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:16,683 INFO L87 Difference]: Start difference. First operand 273 states and 316 transitions. Second operand 41 states. [2019-08-05 10:14:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:18,400 INFO L93 Difference]: Finished difference Result 631 states and 714 transitions. [2019-08-05 10:14:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:14:18,401 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 131 [2019-08-05 10:14:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:18,404 INFO L225 Difference]: With dead ends: 631 [2019-08-05 10:14:18,404 INFO L226 Difference]: Without dead ends: 631 [2019-08-05 10:14:18,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1315, Invalid=5165, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:14:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-08-05 10:14:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 480. [2019-08-05 10:14:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-08-05 10:14:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 555 transitions. [2019-08-05 10:14:18,409 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 555 transitions. Word has length 131 [2019-08-05 10:14:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:18,410 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 555 transitions. [2019-08-05 10:14:18,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 555 transitions. [2019-08-05 10:14:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:18,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:18,411 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:18,411 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1930998811, now seen corresponding path program 47 times [2019-08-05 10:14:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:18,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:18,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:18,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:18,749 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:14:18,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:18,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:18,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:19,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:19,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:19,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:19,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:19,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:19,738 INFO L87 Difference]: Start difference. First operand 480 states and 555 transitions. Second operand 41 states. [2019-08-05 10:14:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:21,448 INFO L93 Difference]: Finished difference Result 784 states and 891 transitions. [2019-08-05 10:14:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:14:21,449 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2019-08-05 10:14:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:21,452 INFO L225 Difference]: With dead ends: 784 [2019-08-05 10:14:21,452 INFO L226 Difference]: Without dead ends: 784 [2019-08-05 10:14:21,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1985 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1318, Invalid=5324, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:14:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-08-05 10:14:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 438. [2019-08-05 10:14:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-08-05 10:14:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 508 transitions. [2019-08-05 10:14:21,458 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 508 transitions. Word has length 133 [2019-08-05 10:14:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:21,458 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 508 transitions. [2019-08-05 10:14:21,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 508 transitions. [2019-08-05 10:14:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:21,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:21,459 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:21,459 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash -382399383, now seen corresponding path program 48 times [2019-08-05 10:14:21,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:21,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:21,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:21,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:21,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:21,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:21,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:21,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:21,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:21,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:22,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:22,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:22,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:22,642 INFO L87 Difference]: Start difference. First operand 438 states and 508 transitions. Second operand 41 states. [2019-08-05 10:14:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:24,338 INFO L93 Difference]: Finished difference Result 653 states and 747 transitions. [2019-08-05 10:14:24,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:14:24,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2019-08-05 10:14:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:24,342 INFO L225 Difference]: With dead ends: 653 [2019-08-05 10:14:24,342 INFO L226 Difference]: Without dead ends: 653 [2019-08-05 10:14:24,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1296, Invalid=5346, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:14:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-08-05 10:14:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 396. [2019-08-05 10:14:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-08-05 10:14:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 461 transitions. [2019-08-05 10:14:24,347 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 461 transitions. Word has length 133 [2019-08-05 10:14:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:24,348 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 461 transitions. [2019-08-05 10:14:24,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 461 transitions. [2019-08-05 10:14:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:24,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:24,349 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:24,349 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:24,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1260541861, now seen corresponding path program 49 times [2019-08-05 10:14:24,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:24,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:24,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:24,505 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:14:24,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:24,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:25,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:25,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:25,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:25,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:25,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:25,172 INFO L87 Difference]: Start difference. First operand 396 states and 461 transitions. Second operand 41 states. [2019-08-05 10:14:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:26,885 INFO L93 Difference]: Finished difference Result 536 states and 617 transitions. [2019-08-05 10:14:26,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:14:26,885 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2019-08-05 10:14:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:26,888 INFO L225 Difference]: With dead ends: 536 [2019-08-05 10:14:26,888 INFO L226 Difference]: Without dead ends: 536 [2019-08-05 10:14:26,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1991 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1260, Invalid=5382, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:14:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-08-05 10:14:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 320. [2019-08-05 10:14:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-08-05 10:14:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 375 transitions. [2019-08-05 10:14:26,893 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 375 transitions. Word has length 133 [2019-08-05 10:14:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:26,893 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 375 transitions. [2019-08-05 10:14:26,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 375 transitions. [2019-08-05 10:14:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:26,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:26,894 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:26,894 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:26,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1811927081, now seen corresponding path program 50 times [2019-08-05 10:14:26,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:26,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:26,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:27,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:27,253 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:14:27,425 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:14:27,854 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:14:28,128 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:14:28,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,456 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:14:28,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:29,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:29,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:29,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:29,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:29,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:29,446 INFO L87 Difference]: Start difference. First operand 320 states and 375 transitions. Second operand 41 states. [2019-08-05 10:14:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:31,201 INFO L93 Difference]: Finished difference Result 446 states and 518 transitions. [2019-08-05 10:14:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:14:31,202 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2019-08-05 10:14:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:31,203 INFO L225 Difference]: With dead ends: 446 [2019-08-05 10:14:31,203 INFO L226 Difference]: Without dead ends: 446 [2019-08-05 10:14:31,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1175, Invalid=5145, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:14:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-08-05 10:14:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 308. [2019-08-05 10:14:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 10:14:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 362 transitions. [2019-08-05 10:14:31,208 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 362 transitions. Word has length 133 [2019-08-05 10:14:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:31,208 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 362 transitions. [2019-08-05 10:14:31,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 362 transitions. [2019-08-05 10:14:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:31,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:31,209 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 10, 10, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:31,209 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:31,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash -409303215, now seen corresponding path program 51 times [2019-08-05 10:14:31,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:31,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:14:31,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:31,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:31,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:31,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:14:31,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:14:31,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:14:31,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:14:31,984 INFO L87 Difference]: Start difference. First operand 308 states and 362 transitions. Second operand 40 states. [2019-08-05 10:14:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:33,805 INFO L93 Difference]: Finished difference Result 398 states and 457 transitions. [2019-08-05 10:14:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:14:33,806 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 133 [2019-08-05 10:14:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:33,808 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:14:33,808 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:14:33,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1108, Invalid=5054, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:14:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:14:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 282. [2019-08-05 10:14:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-08-05 10:14:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 328 transitions. [2019-08-05 10:14:33,812 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 328 transitions. Word has length 133 [2019-08-05 10:14:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:33,813 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 328 transitions. [2019-08-05 10:14:33,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:14:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 328 transitions. [2019-08-05 10:14:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:14:33,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:33,813 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 11, 10, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:33,814 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -136341894, now seen corresponding path program 52 times [2019-08-05 10:14:33,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:33,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:33,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:33,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:34,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:34,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:34,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:34,589 INFO L87 Difference]: Start difference. First operand 282 states and 328 transitions. Second operand 42 states. [2019-08-05 10:14:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:36,398 INFO L93 Difference]: Finished difference Result 399 states and 462 transitions. [2019-08-05 10:14:36,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:14:36,399 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 139 [2019-08-05 10:14:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:36,401 INFO L225 Difference]: With dead ends: 399 [2019-08-05 10:14:36,401 INFO L226 Difference]: Without dead ends: 399 [2019-08-05 10:14:36,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1211, Invalid=5595, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:14:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-08-05 10:14:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 263. [2019-08-05 10:14:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-08-05 10:14:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 306 transitions. [2019-08-05 10:14:36,405 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 306 transitions. Word has length 139 [2019-08-05 10:14:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:36,405 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 306 transitions. [2019-08-05 10:14:36,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 306 transitions. [2019-08-05 10:14:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:14:36,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:36,406 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 11, 10, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:36,406 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1314838879, now seen corresponding path program 53 times [2019-08-05 10:14:36,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:36,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:36,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:36,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,766 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:14:36,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:37,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:37,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:37,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:37,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:37,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:37,756 INFO L87 Difference]: Start difference. First operand 263 states and 306 transitions. Second operand 42 states. [2019-08-05 10:14:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:39,432 INFO L93 Difference]: Finished difference Result 616 states and 694 transitions. [2019-08-05 10:14:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:14:39,432 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 139 [2019-08-05 10:14:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:39,435 INFO L225 Difference]: With dead ends: 616 [2019-08-05 10:14:39,435 INFO L226 Difference]: Without dead ends: 616 [2019-08-05 10:14:39,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1365, Invalid=5441, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:14:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-08-05 10:14:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 470. [2019-08-05 10:14:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-08-05 10:14:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 538 transitions. [2019-08-05 10:14:39,441 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 538 transitions. Word has length 139 [2019-08-05 10:14:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:39,441 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 538 transitions. [2019-08-05 10:14:39,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 538 transitions. [2019-08-05 10:14:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:39,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:39,442 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:39,442 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:39,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:39,442 INFO L82 PathProgramCache]: Analyzing trace with hash 177336712, now seen corresponding path program 54 times [2019-08-05 10:14:39,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:39,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:39,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:39,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:40,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:40,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:40,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:40,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:40,623 INFO L87 Difference]: Start difference. First operand 470 states and 538 transitions. Second operand 42 states. [2019-08-05 10:14:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:42,353 INFO L93 Difference]: Finished difference Result 769 states and 864 transitions. [2019-08-05 10:14:42,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:14:42,353 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:42,357 INFO L225 Difference]: With dead ends: 769 [2019-08-05 10:14:42,357 INFO L226 Difference]: Without dead ends: 769 [2019-08-05 10:14:42,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1368, Invalid=5604, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:14:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-08-05 10:14:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 428. [2019-08-05 10:14:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-08-05 10:14:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 491 transitions. [2019-08-05 10:14:42,362 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 491 transitions. Word has length 141 [2019-08-05 10:14:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:42,362 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 491 transitions. [2019-08-05 10:14:42,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 491 transitions. [2019-08-05 10:14:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:42,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:42,363 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:42,364 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:42,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:42,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1471159254, now seen corresponding path program 55 times [2019-08-05 10:14:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:42,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:42,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:42,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:43,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:43,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:43,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:43,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:43,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:43,340 INFO L87 Difference]: Start difference. First operand 428 states and 491 transitions. Second operand 42 states. [2019-08-05 10:14:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:45,090 INFO L93 Difference]: Finished difference Result 637 states and 719 transitions. [2019-08-05 10:14:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:14:45,090 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:45,094 INFO L225 Difference]: With dead ends: 637 [2019-08-05 10:14:45,094 INFO L226 Difference]: Without dead ends: 637 [2019-08-05 10:14:45,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1346, Invalid=5626, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:14:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-08-05 10:14:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 386. [2019-08-05 10:14:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-08-05 10:14:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 444 transitions. [2019-08-05 10:14:45,100 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 444 transitions. Word has length 141 [2019-08-05 10:14:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:45,100 INFO L475 AbstractCegarLoop]: Abstraction has 386 states and 444 transitions. [2019-08-05 10:14:45,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 444 transitions. [2019-08-05 10:14:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:45,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:45,102 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:45,102 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1824610872, now seen corresponding path program 56 times [2019-08-05 10:14:45,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:45,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:45,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:45,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:45,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:45,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:45,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:45,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:45,986 INFO L87 Difference]: Start difference. First operand 386 states and 444 transitions. Second operand 42 states. [2019-08-05 10:14:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:47,908 INFO L93 Difference]: Finished difference Result 554 states and 628 transitions. [2019-08-05 10:14:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:14:47,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:47,911 INFO L225 Difference]: With dead ends: 554 [2019-08-05 10:14:47,911 INFO L226 Difference]: Without dead ends: 554 [2019-08-05 10:14:47,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1310, Invalid=5662, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:14:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-08-05 10:14:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 344. [2019-08-05 10:14:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 10:14:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 397 transitions. [2019-08-05 10:14:47,915 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 397 transitions. Word has length 141 [2019-08-05 10:14:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:47,915 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 397 transitions. [2019-08-05 10:14:47,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 397 transitions. [2019-08-05 10:14:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:47,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:47,916 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:47,917 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:47,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1000661098, now seen corresponding path program 57 times [2019-08-05 10:14:47,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:47,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:47,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:48,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,221 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:14:48,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:49,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:49,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:49,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:49,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:49,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:49,039 INFO L87 Difference]: Start difference. First operand 344 states and 397 transitions. Second operand 42 states. [2019-08-05 10:14:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:50,817 INFO L93 Difference]: Finished difference Result 473 states and 539 transitions. [2019-08-05 10:14:50,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:14:50,818 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:50,820 INFO L225 Difference]: With dead ends: 473 [2019-08-05 10:14:50,820 INFO L226 Difference]: Without dead ends: 473 [2019-08-05 10:14:50,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1276, Invalid=5696, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:14:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-08-05 10:14:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 304. [2019-08-05 10:14:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 10:14:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 352 transitions. [2019-08-05 10:14:50,824 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 352 transitions. Word has length 141 [2019-08-05 10:14:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:50,825 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 352 transitions. [2019-08-05 10:14:50,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 352 transitions. [2019-08-05 10:14:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:50,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:50,825 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:50,826 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:50,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash -524490232, now seen corresponding path program 58 times [2019-08-05 10:14:50,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:50,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:50,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:50,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:52,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:52,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:52,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:52,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:52,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:52,125 INFO L87 Difference]: Start difference. First operand 304 states and 352 transitions. Second operand 42 states. [2019-08-05 10:14:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:54,088 INFO L93 Difference]: Finished difference Result 398 states and 454 transitions. [2019-08-05 10:14:54,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:14:54,088 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:54,090 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:14:54,090 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:14:54,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1211, Invalid=5595, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:14:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:14:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 303. [2019-08-05 10:14:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-08-05 10:14:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 349 transitions. [2019-08-05 10:14:54,095 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 349 transitions. Word has length 141 [2019-08-05 10:14:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:54,096 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 349 transitions. [2019-08-05 10:14:54,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 349 transitions. [2019-08-05 10:14:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:14:54,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:54,097 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 11, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:54,097 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:54,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1053751188, now seen corresponding path program 59 times [2019-08-05 10:14:54,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:54,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:14:54,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:54,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 0 proven. 966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:54,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:54,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:54,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1681, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:54,936 INFO L87 Difference]: Start difference. First operand 303 states and 349 transitions. Second operand 46 states. [2019-08-05 10:14:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:56,742 INFO L93 Difference]: Finished difference Result 686 states and 769 transitions. [2019-08-05 10:14:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:14:56,742 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 150 [2019-08-05 10:14:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:56,745 INFO L225 Difference]: With dead ends: 686 [2019-08-05 10:14:56,745 INFO L226 Difference]: Without dead ends: 686 [2019-08-05 10:14:56,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1611, Invalid=6399, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:14:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-08-05 10:14:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 520. [2019-08-05 10:14:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-08-05 10:14:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 592 transitions. [2019-08-05 10:14:56,752 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 592 transitions. Word has length 150 [2019-08-05 10:14:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:56,752 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 592 transitions. [2019-08-05 10:14:56,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:14:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 592 transitions. [2019-08-05 10:14:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:14:56,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:56,753 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:56,754 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:56,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:56,754 INFO L82 PathProgramCache]: Analyzing trace with hash -676308021, now seen corresponding path program 60 times [2019-08-05 10:14:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:56,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:14:56,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:56,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:56,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:56,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:56,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:56,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:56,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:56,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:57,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:57,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:57,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:57,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:57,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:57,635 INFO L87 Difference]: Start difference. First operand 520 states and 592 transitions. Second operand 46 states. [2019-08-05 10:14:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:59,764 INFO L93 Difference]: Finished difference Result 854 states and 955 transitions. [2019-08-05 10:14:59,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:14:59,765 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:14:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:59,769 INFO L225 Difference]: With dead ends: 854 [2019-08-05 10:14:59,769 INFO L226 Difference]: Without dead ends: 854 [2019-08-05 10:14:59,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1615, Invalid=6575, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:14:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-08-05 10:14:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 478. [2019-08-05 10:14:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-08-05 10:14:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 545 transitions. [2019-08-05 10:14:59,775 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 545 transitions. Word has length 152 [2019-08-05 10:14:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:59,775 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 545 transitions. [2019-08-05 10:14:59,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:14:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 545 transitions. [2019-08-05 10:14:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:14:59,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:59,776 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:59,776 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:59,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1226069181, now seen corresponding path program 61 times [2019-08-05 10:14:59,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:59,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:14:59,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:59,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:59,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:59,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:59,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:59,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:59,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:59,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:00,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:00,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:15:00,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:15:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:15:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:15:00,667 INFO L87 Difference]: Start difference. First operand 478 states and 545 transitions. Second operand 46 states. [2019-08-05 10:15:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:02,726 INFO L93 Difference]: Finished difference Result 719 states and 807 transitions. [2019-08-05 10:15:02,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:15:02,727 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:15:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:02,731 INFO L225 Difference]: With dead ends: 719 [2019-08-05 10:15:02,731 INFO L226 Difference]: Without dead ends: 719 [2019-08-05 10:15:02,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2491 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1593, Invalid=6597, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:15:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-08-05 10:15:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 436. [2019-08-05 10:15:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:15:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 498 transitions. [2019-08-05 10:15:02,737 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 498 transitions. Word has length 152 [2019-08-05 10:15:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:02,737 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 498 transitions. [2019-08-05 10:15:02,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:15:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 498 transitions. [2019-08-05 10:15:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:15:02,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:02,738 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:02,739 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:02,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:02,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1077182347, now seen corresponding path program 62 times [2019-08-05 10:15:02,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:02,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:15:02,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:02,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:02,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:02,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:02,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:03,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:03,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:15:03,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:15:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:15:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:15:03,967 INFO L87 Difference]: Start difference. First operand 436 states and 498 transitions. Second operand 46 states. [2019-08-05 10:15:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:06,036 INFO L93 Difference]: Finished difference Result 624 states and 703 transitions. [2019-08-05 10:15:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:15:06,037 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:15:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:06,040 INFO L225 Difference]: With dead ends: 624 [2019-08-05 10:15:06,040 INFO L226 Difference]: Without dead ends: 624 [2019-08-05 10:15:06,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2506 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1557, Invalid=6633, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:15:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-08-05 10:15:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 394. [2019-08-05 10:15:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-08-05 10:15:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 451 transitions. [2019-08-05 10:15:06,046 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 451 transitions. Word has length 152 [2019-08-05 10:15:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:06,046 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 451 transitions. [2019-08-05 10:15:06,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:15:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 451 transitions. [2019-08-05 10:15:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:15:06,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:06,047 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:06,047 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:06,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:06,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1380615939, now seen corresponding path program 63 times [2019-08-05 10:15:06,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:06,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:15:06,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:06,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:06,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:06,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:15:06,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:15:06,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:15:06,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:15:06,954 INFO L87 Difference]: Start difference. First operand 394 states and 451 transitions. Second operand 46 states. [2019-08-05 10:15:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:09,240 INFO L93 Difference]: Finished difference Result 507 states and 573 transitions. [2019-08-05 10:15:09,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:15:09,241 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:15:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:09,243 INFO L225 Difference]: With dead ends: 507 [2019-08-05 10:15:09,244 INFO L226 Difference]: Without dead ends: 507 [2019-08-05 10:15:09,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1523, Invalid=6667, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:15:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-08-05 10:15:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 318. [2019-08-05 10:15:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-08-05 10:15:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 365 transitions. [2019-08-05 10:15:09,248 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 365 transitions. Word has length 152 [2019-08-05 10:15:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:09,249 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 365 transitions. [2019-08-05 10:15:09,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:15:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 365 transitions. [2019-08-05 10:15:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:15:09,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:09,250 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:09,250 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:09,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1414337355, now seen corresponding path program 64 times [2019-08-05 10:15:09,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:09,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:15:09,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:09,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:10,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:10,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:15:10,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:15:10,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:15:10,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:15:10,121 INFO L87 Difference]: Start difference. First operand 318 states and 365 transitions. Second operand 46 states. [2019-08-05 10:15:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:12,238 INFO L93 Difference]: Finished difference Result 427 states and 485 transitions. [2019-08-05 10:15:12,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:15:12,238 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:15:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:12,241 INFO L225 Difference]: With dead ends: 427 [2019-08-05 10:15:12,241 INFO L226 Difference]: Without dead ends: 427 [2019-08-05 10:15:12,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1455, Invalid=6555, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:15:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-08-05 10:15:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 313. [2019-08-05 10:15:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-08-05 10:15:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 360 transitions. [2019-08-05 10:15:12,245 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 360 transitions. Word has length 152 [2019-08-05 10:15:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:12,245 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 360 transitions. [2019-08-05 10:15:12,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:15:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 360 transitions. [2019-08-05 10:15:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:15:12,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:12,246 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 12, 12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:12,246 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:12,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1438545795, now seen corresponding path program 65 times [2019-08-05 10:15:12,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:12,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:12,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:12,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:12,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1067 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:13,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:13,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:13,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1833, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:13,155 INFO L87 Difference]: Start difference. First operand 313 states and 360 transitions. Second operand 48 states. [2019-08-05 10:15:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:15,447 INFO L93 Difference]: Finished difference Result 775 states and 872 transitions. [2019-08-05 10:15:15,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:15:15,447 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 156 [2019-08-05 10:15:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:15,452 INFO L225 Difference]: With dead ends: 775 [2019-08-05 10:15:15,452 INFO L226 Difference]: Without dead ends: 775 [2019-08-05 10:15:15,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1828, Invalid=7292, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:15:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-08-05 10:15:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 562. [2019-08-05 10:15:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-08-05 10:15:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 646 transitions. [2019-08-05 10:15:15,460 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 646 transitions. Word has length 156 [2019-08-05 10:15:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:15,461 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 646 transitions. [2019-08-05 10:15:15,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 646 transitions. [2019-08-05 10:15:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:15,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:15,462 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:15,462 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1560369292, now seen corresponding path program 66 times [2019-08-05 10:15:15,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:15,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:15,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:15,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:15,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:16,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:16,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:16,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:16,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:16,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:16,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:16,425 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:15:16,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:16,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:16,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:16,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:16,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:16,426 INFO L87 Difference]: Start difference. First operand 562 states and 646 transitions. Second operand 48 states. [2019-08-05 10:15:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:18,922 INFO L93 Difference]: Finished difference Result 977 states and 1103 transitions. [2019-08-05 10:15:18,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:15:18,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:18,927 INFO L225 Difference]: With dead ends: 977 [2019-08-05 10:15:18,927 INFO L226 Difference]: Without dead ends: 977 [2019-08-05 10:15:18,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2893 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1832, Invalid=7480, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:15:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-08-05 10:15:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 520. [2019-08-05 10:15:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-08-05 10:15:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 599 transitions. [2019-08-05 10:15:18,936 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 599 transitions. Word has length 158 [2019-08-05 10:15:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:18,936 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 599 transitions. [2019-08-05 10:15:18,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 599 transitions. [2019-08-05 10:15:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:18,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:18,938 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:18,938 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1227662054, now seen corresponding path program 67 times [2019-08-05 10:15:18,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:18,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:18,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:19,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:19,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:20,152 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:15:20,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:20,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:20,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:20,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:20,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:20,153 INFO L87 Difference]: Start difference. First operand 520 states and 599 transitions. Second operand 48 states. [2019-08-05 10:15:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:22,463 INFO L93 Difference]: Finished difference Result 842 states and 955 transitions. [2019-08-05 10:15:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:15:22,464 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:22,467 INFO L225 Difference]: With dead ends: 842 [2019-08-05 10:15:22,467 INFO L226 Difference]: Without dead ends: 842 [2019-08-05 10:15:22,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1810, Invalid=7502, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:15:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-08-05 10:15:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 478. [2019-08-05 10:15:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-08-05 10:15:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 552 transitions. [2019-08-05 10:15:22,475 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 552 transitions. Word has length 158 [2019-08-05 10:15:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,476 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 552 transitions. [2019-08-05 10:15:22,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 552 transitions. [2019-08-05 10:15:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:22,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,477 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:22,477 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1085736140, now seen corresponding path program 68 times [2019-08-05 10:15:22,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:23,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:23,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:23,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:23,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:23,422 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:15:23,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:23,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:23,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:23,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:23,424 INFO L87 Difference]: Start difference. First operand 478 states and 552 transitions. Second operand 48 states. [2019-08-05 10:15:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,889 INFO L93 Difference]: Finished difference Result 711 states and 811 transitions. [2019-08-05 10:15:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:15:25,890 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,891 INFO L225 Difference]: With dead ends: 711 [2019-08-05 10:15:25,892 INFO L226 Difference]: Without dead ends: 711 [2019-08-05 10:15:25,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1774, Invalid=7538, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:15:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-08-05 10:15:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 436. [2019-08-05 10:15:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:15:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 505 transitions. [2019-08-05 10:15:25,898 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 505 transitions. Word has length 158 [2019-08-05 10:15:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,898 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 505 transitions. [2019-08-05 10:15:25,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 505 transitions. [2019-08-05 10:15:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:25,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,900 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:25,900 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1963878618, now seen corresponding path program 69 times [2019-08-05 10:15:25,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:25,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:26,825 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:15:26,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:26,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:26,826 INFO L87 Difference]: Start difference. First operand 436 states and 505 transitions. Second operand 48 states. [2019-08-05 10:15:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:29,424 INFO L93 Difference]: Finished difference Result 594 states and 681 transitions. [2019-08-05 10:15:29,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:15:29,424 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:29,425 INFO L225 Difference]: With dead ends: 594 [2019-08-05 10:15:29,425 INFO L226 Difference]: Without dead ends: 594 [2019-08-05 10:15:29,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1724, Invalid=7588, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:15:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-08-05 10:15:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 360. [2019-08-05 10:15:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-08-05 10:15:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 419 transitions. [2019-08-05 10:15:29,431 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 419 transitions. Word has length 158 [2019-08-05 10:15:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:29,431 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 419 transitions. [2019-08-05 10:15:29,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 419 transitions. [2019-08-05 10:15:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:29,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:29,432 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:29,432 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1108590324, now seen corresponding path program 70 times [2019-08-05 10:15:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:29,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:29,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:29,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:29,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:30,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:30,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:30,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:30,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:30,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:30,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:30,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:30,544 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:15:30,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:30,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:30,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:30,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:30,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:30,546 INFO L87 Difference]: Start difference. First operand 360 states and 419 transitions. Second operand 48 states. [2019-08-05 10:15:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:32,875 INFO L93 Difference]: Finished difference Result 504 states and 582 transitions. [2019-08-05 10:15:32,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:15:32,876 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:32,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:32,877 INFO L225 Difference]: With dead ends: 504 [2019-08-05 10:15:32,877 INFO L226 Difference]: Without dead ends: 504 [2019-08-05 10:15:32,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1621, Invalid=7309, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:15:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-08-05 10:15:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 348. [2019-08-05 10:15:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-05 10:15:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 406 transitions. [2019-08-05 10:15:32,883 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 406 transitions. Word has length 158 [2019-08-05 10:15:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:32,883 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 406 transitions. [2019-08-05 10:15:32,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 406 transitions. [2019-08-05 10:15:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:32,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:32,884 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 12, 12, 11, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:32,885 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:32,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1112639972, now seen corresponding path program 71 times [2019-08-05 10:15:32,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:32,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:15:32,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:33,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 0 proven. 1078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:34,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:15:34,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:15:34,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:15:34,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1763, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:15:34,173 INFO L87 Difference]: Start difference. First operand 348 states and 406 transitions. Second operand 47 states. [2019-08-05 10:15:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:36,402 INFO L93 Difference]: Finished difference Result 456 states and 521 transitions. [2019-08-05 10:15:36,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:15:36,403 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 158 [2019-08-05 10:15:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:36,404 INFO L225 Difference]: With dead ends: 456 [2019-08-05 10:15:36,404 INFO L226 Difference]: Without dead ends: 456 [2019-08-05 10:15:36,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2651 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1539, Invalid=7203, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:15:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-08-05 10:15:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 322. [2019-08-05 10:15:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-08-05 10:15:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 372 transitions. [2019-08-05 10:15:36,410 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 372 transitions. Word has length 158 [2019-08-05 10:15:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:36,410 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 372 transitions. [2019-08-05 10:15:36,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:15:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 372 transitions. [2019-08-05 10:15:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:15:36,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:36,411 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 13, 12, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:36,411 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1319501563, now seen corresponding path program 72 times [2019-08-05 10:15:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:36,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:36,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:36,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:36,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 0 proven. 1184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:37,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:37,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:37,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:37,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:37,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:37,337 INFO L87 Difference]: Start difference. First operand 322 states and 372 transitions. Second operand 49 states. [2019-08-05 10:15:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:39,867 INFO L93 Difference]: Finished difference Result 457 states and 526 transitions. [2019-08-05 10:15:39,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:15:39,868 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 164 [2019-08-05 10:15:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:39,869 INFO L225 Difference]: With dead ends: 457 [2019-08-05 10:15:39,869 INFO L226 Difference]: Without dead ends: 457 [2019-08-05 10:15:39,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1661, Invalid=7845, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:15:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-08-05 10:15:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 303. [2019-08-05 10:15:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-08-05 10:15:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 350 transitions. [2019-08-05 10:15:39,875 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 350 transitions. Word has length 164 [2019-08-05 10:15:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:39,875 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 350 transitions. [2019-08-05 10:15:39,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 350 transitions. [2019-08-05 10:15:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:15:39,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:39,876 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 13, 12, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:39,876 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 131679210, now seen corresponding path program 73 times [2019-08-05 10:15:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:39,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:39,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:39,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:39,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 0 proven. 1184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:40,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:40,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:40,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1914, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:40,804 INFO L87 Difference]: Start difference. First operand 303 states and 350 transitions. Second operand 49 states. [2019-08-05 10:15:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:42,961 INFO L93 Difference]: Finished difference Result 760 states and 852 transitions. [2019-08-05 10:15:42,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:15:42,961 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 164 [2019-08-05 10:15:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:42,963 INFO L225 Difference]: With dead ends: 760 [2019-08-05 10:15:42,963 INFO L226 Difference]: Without dead ends: 760 [2019-08-05 10:15:42,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2982 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1886, Invalid=7620, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:15:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-08-05 10:15:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 552. [2019-08-05 10:15:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-08-05 10:15:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 629 transitions. [2019-08-05 10:15:42,969 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 629 transitions. Word has length 164 [2019-08-05 10:15:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:42,969 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 629 transitions. [2019-08-05 10:15:42,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 629 transitions. [2019-08-05 10:15:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:15:42,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:42,970 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 12, 11, 9, 9, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:42,971 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:42,971 INFO L82 PathProgramCache]: Analyzing trace with hash 111115233, now seen corresponding path program 74 times [2019-08-05 10:15:42,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:43,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:43,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:43,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:43,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:44,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:44,169 INFO L87 Difference]: Start difference. First operand 552 states and 629 transitions. Second operand 49 states. [2019-08-05 10:15:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:46,455 INFO L93 Difference]: Finished difference Result 962 states and 1076 transitions. [2019-08-05 10:15:46,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:15:46,456 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 166 [2019-08-05 10:15:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:46,458 INFO L225 Difference]: With dead ends: 962 [2019-08-05 10:15:46,458 INFO L226 Difference]: Without dead ends: 962 [2019-08-05 10:15:46,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3018 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1890, Invalid=7812, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:15:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-08-05 10:15:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 510. [2019-08-05 10:15:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-08-05 10:15:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 582 transitions. [2019-08-05 10:15:46,465 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 582 transitions. Word has length 166 [2019-08-05 10:15:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:46,465 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 582 transitions. [2019-08-05 10:15:46,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 582 transitions. [2019-08-05 10:15:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:15:46,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:46,466 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 12, 11, 9, 9, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:46,466 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1327228243, now seen corresponding path program 75 times [2019-08-05 10:15:46,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:46,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:46,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:46,657 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:15:46,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:46,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:47,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:47,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:47,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:47,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:47,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:47,585 INFO L87 Difference]: Start difference. First operand 510 states and 582 transitions. Second operand 49 states. [2019-08-05 10:15:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:50,008 INFO L93 Difference]: Finished difference Result 827 states and 928 transitions. [2019-08-05 10:15:50,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:15:50,008 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 166 [2019-08-05 10:15:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:50,010 INFO L225 Difference]: With dead ends: 827 [2019-08-05 10:15:50,010 INFO L226 Difference]: Without dead ends: 827 [2019-08-05 10:15:50,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2985 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1868, Invalid=7834, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:15:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-08-05 10:15:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 468. [2019-08-05 10:15:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-08-05 10:15:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 535 transitions. [2019-08-05 10:15:50,016 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 535 transitions. Word has length 166 [2019-08-05 10:15:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:50,016 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 535 transitions. [2019-08-05 10:15:50,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 535 transitions. [2019-08-05 10:15:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:15:50,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:50,017 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 12, 11, 9, 9, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:50,017 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:50,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1673916511, now seen corresponding path program 76 times [2019-08-05 10:15:50,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:50,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:50,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:50,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:50,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:50,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:50,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:50,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:50,966 INFO L87 Difference]: Start difference. First operand 468 states and 535 transitions. Second operand 49 states. [2019-08-05 10:15:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:53,279 INFO L93 Difference]: Finished difference Result 695 states and 783 transitions. [2019-08-05 10:15:53,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:15:53,279 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 166 [2019-08-05 10:15:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:53,281 INFO L225 Difference]: With dead ends: 695 [2019-08-05 10:15:53,281 INFO L226 Difference]: Without dead ends: 695 [2019-08-05 10:15:53,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1832, Invalid=7870, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:15:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-08-05 10:15:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 426. [2019-08-05 10:15:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-08-05 10:15:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 488 transitions. [2019-08-05 10:15:53,287 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 488 transitions. Word has length 166 [2019-08-05 10:15:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:53,287 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 488 transitions. [2019-08-05 10:15:53,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 488 transitions. [2019-08-05 10:15:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:15:53,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:53,289 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 12, 11, 9, 9, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:53,289 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:53,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash -674719341, now seen corresponding path program 77 times [2019-08-05 10:15:53,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:53,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:53,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:53,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:53,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:54,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:54,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:54,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:54,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:54,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:54,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:54,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:54,269 INFO L87 Difference]: Start difference. First operand 426 states and 488 transitions. Second operand 49 states. [2019-08-05 10:15:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:56,742 INFO L93 Difference]: Finished difference Result 612 states and 692 transitions. [2019-08-05 10:15:56,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:15:56,743 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 166 [2019-08-05 10:15:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:56,745 INFO L225 Difference]: With dead ends: 612 [2019-08-05 10:15:56,745 INFO L226 Difference]: Without dead ends: 612 [2019-08-05 10:15:56,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2980 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1782, Invalid=7920, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:15:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-08-05 10:15:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 384. [2019-08-05 10:15:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-08-05 10:15:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 441 transitions. [2019-08-05 10:15:56,751 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 441 transitions. Word has length 166 [2019-08-05 10:15:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:56,751 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 441 transitions. [2019-08-05 10:15:56,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 441 transitions. [2019-08-05 10:15:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:15:56,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:56,753 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 12, 11, 9, 9, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:56,753 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash 149230433, now seen corresponding path program 78 times [2019-08-05 10:15:56,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:56,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:56,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:56,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:56,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:57,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:57,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:57,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:57,826 INFO L87 Difference]: Start difference. First operand 384 states and 441 transitions. Second operand 49 states. [2019-08-05 10:16:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:00,455 INFO L93 Difference]: Finished difference Result 531 states and 603 transitions. [2019-08-05 10:16:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:16:00,455 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 166 [2019-08-05 10:16:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:00,457 INFO L225 Difference]: With dead ends: 531 [2019-08-05 10:16:00,457 INFO L226 Difference]: Without dead ends: 531 [2019-08-05 10:16:00,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1738, Invalid=7964, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:16:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-08-05 10:16:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 344. [2019-08-05 10:16:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 10:16:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 396 transitions. [2019-08-05 10:16:00,463 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 396 transitions. Word has length 166 [2019-08-05 10:16:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:00,463 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 396 transitions. [2019-08-05 10:16:00,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:16:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 396 transitions. [2019-08-05 10:16:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:16:00,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:00,464 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 12, 11, 9, 9, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:16:00,464 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash 625401299, now seen corresponding path program 79 times [2019-08-05 10:16:00,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:00,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:16:00,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:00,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:01,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:01,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:01,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:01,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:01,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:01,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:01,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:16:01,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:16:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:16:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:16:01,454 INFO L87 Difference]: Start difference. First operand 344 states and 396 transitions. Second operand 49 states. [2019-08-05 10:16:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:03,774 INFO L93 Difference]: Finished difference Result 456 states and 518 transitions. [2019-08-05 10:16:03,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:16:03,775 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 166 [2019-08-05 10:16:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:03,776 INFO L225 Difference]: With dead ends: 456 [2019-08-05 10:16:03,776 INFO L226 Difference]: Without dead ends: 456 [2019-08-05 10:16:03,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1661, Invalid=7845, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:16:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-08-05 10:16:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 343. [2019-08-05 10:16:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-08-05 10:16:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 393 transitions. [2019-08-05 10:16:03,780 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 393 transitions. Word has length 166 [2019-08-05 10:16:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:03,780 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 393 transitions. [2019-08-05 10:16:03,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:16:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 393 transitions. [2019-08-05 10:16:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:16:03,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:03,781 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 14, 13, 13, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:03,781 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:03,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1896028201, now seen corresponding path program 80 times [2019-08-05 10:16:03,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:03,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:16:03,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:03,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:03,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:03,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:03,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:04,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:05,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 0 proven. 1333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:05,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:05,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:05,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:05,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=2251, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:05,138 INFO L87 Difference]: Start difference. First operand 343 states and 393 transitions. Second operand 53 states. [2019-08-05 10:16:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:07,395 INFO L93 Difference]: Finished difference Result 842 states and 940 transitions. [2019-08-05 10:16:07,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:16:07,395 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 175 [2019-08-05 10:16:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:07,398 INFO L225 Difference]: With dead ends: 842 [2019-08-05 10:16:07,398 INFO L226 Difference]: Without dead ends: 842 [2019-08-05 10:16:07,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3477 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2173, Invalid=8747, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:16:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-08-05 10:16:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 602. [2019-08-05 10:16:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-08-05 10:16:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 683 transitions. [2019-08-05 10:16:07,405 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 683 transitions. Word has length 175 [2019-08-05 10:16:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:07,406 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 683 transitions. [2019-08-05 10:16:07,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 683 transitions. [2019-08-05 10:16:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:16:07,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:07,407 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 14, 12, 12, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:07,408 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash 829099986, now seen corresponding path program 81 times [2019-08-05 10:16:07,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:07,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:16:07,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:07,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:07,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 0 proven. 1349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:08,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:08,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:08,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:08,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2255, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:08,600 INFO L87 Difference]: Start difference. First operand 602 states and 683 transitions. Second operand 53 states. [2019-08-05 10:16:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:11,194 INFO L93 Difference]: Finished difference Result 1047 states and 1167 transitions. [2019-08-05 10:16:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:16:11,194 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 177 [2019-08-05 10:16:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:11,196 INFO L225 Difference]: With dead ends: 1047 [2019-08-05 10:16:11,197 INFO L226 Difference]: Without dead ends: 1047 [2019-08-05 10:16:11,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3527 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2178, Invalid=8952, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:16:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-08-05 10:16:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 560. [2019-08-05 10:16:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-08-05 10:16:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 636 transitions. [2019-08-05 10:16:11,204 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 636 transitions. Word has length 177 [2019-08-05 10:16:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:11,205 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 636 transitions. [2019-08-05 10:16:11,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 636 transitions. [2019-08-05 10:16:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:16:11,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:11,206 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 14, 12, 12, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:11,207 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1298049824, now seen corresponding path program 82 times [2019-08-05 10:16:11,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:11,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:16:11,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:11,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,893 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:11,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:12,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:12,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:12,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:12,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 0 proven. 1349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:12,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:12,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2255, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:12,355 INFO L87 Difference]: Start difference. First operand 560 states and 636 transitions. Second operand 53 states. [2019-08-05 10:16:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:14,815 INFO L93 Difference]: Finished difference Result 912 states and 1019 transitions. [2019-08-05 10:16:14,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:16:14,815 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 177 [2019-08-05 10:16:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:14,817 INFO L225 Difference]: With dead ends: 912 [2019-08-05 10:16:14,817 INFO L226 Difference]: Without dead ends: 912 [2019-08-05 10:16:14,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2156, Invalid=8974, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:16:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-08-05 10:16:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 518. [2019-08-05 10:16:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-08-05 10:16:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 589 transitions. [2019-08-05 10:16:14,823 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 589 transitions. Word has length 177 [2019-08-05 10:16:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:14,824 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 589 transitions. [2019-08-05 10:16:14,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 589 transitions. [2019-08-05 10:16:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:16:14,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:14,825 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 14, 12, 12, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:14,826 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1094540270, now seen corresponding path program 83 times [2019-08-05 10:16:14,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:14,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:16:14,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:14,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:15,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 0 proven. 1349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:16,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:16,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:16,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2255, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:16,045 INFO L87 Difference]: Start difference. First operand 518 states and 589 transitions. Second operand 53 states. [2019-08-05 10:16:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:18,522 INFO L93 Difference]: Finished difference Result 777 states and 871 transitions. [2019-08-05 10:16:18,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:16:18,523 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 177 [2019-08-05 10:16:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:18,524 INFO L225 Difference]: With dead ends: 777 [2019-08-05 10:16:18,524 INFO L226 Difference]: Without dead ends: 777 [2019-08-05 10:16:18,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3460 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2120, Invalid=9010, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:16:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-08-05 10:16:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 476. [2019-08-05 10:16:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-08-05 10:16:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 542 transitions. [2019-08-05 10:16:18,530 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 542 transitions. Word has length 177 [2019-08-05 10:16:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:18,530 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 542 transitions. [2019-08-05 10:16:18,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 542 transitions. [2019-08-05 10:16:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:16:18,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:18,531 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 14, 12, 12, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:18,532 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:18,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:18,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1243427104, now seen corresponding path program 84 times [2019-08-05 10:16:18,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:18,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:16:18,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:18,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:18,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 0 proven. 1349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:19,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:19,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:19,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:19,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:19,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2255, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:19,608 INFO L87 Difference]: Start difference. First operand 476 states and 542 transitions. Second operand 53 states. [2019-08-05 10:16:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:22,359 INFO L93 Difference]: Finished difference Result 682 states and 767 transitions. [2019-08-05 10:16:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:16:22,359 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 177 [2019-08-05 10:16:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:22,360 INFO L225 Difference]: With dead ends: 682 [2019-08-05 10:16:22,360 INFO L226 Difference]: Without dead ends: 682 [2019-08-05 10:16:22,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3469 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2070, Invalid=9060, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:16:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-08-05 10:16:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 434. [2019-08-05 10:16:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-08-05 10:16:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 495 transitions. [2019-08-05 10:16:22,366 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 495 transitions. Word has length 177 [2019-08-05 10:16:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:22,366 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 495 transitions. [2019-08-05 10:16:22,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 495 transitions. [2019-08-05 10:16:22,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:16:22,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:22,367 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 14, 12, 12, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:22,367 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 593741906, now seen corresponding path program 85 times [2019-08-05 10:16:22,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:22,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:16:22,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:22,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:22,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:22,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:22,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:22,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:22,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:22,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:22,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,123 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:16:23,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:23,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 0 proven. 1349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:24,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:24,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:24,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:24,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:24,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2255, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:24,096 INFO L87 Difference]: Start difference. First operand 434 states and 495 transitions. Second operand 53 states. [2019-08-05 10:16:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:26,895 INFO L93 Difference]: Finished difference Result 565 states and 637 transitions. [2019-08-05 10:16:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:16:26,896 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 177 [2019-08-05 10:16:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:26,897 INFO L225 Difference]: With dead ends: 565 [2019-08-05 10:16:26,897 INFO L226 Difference]: Without dead ends: 565 [2019-08-05 10:16:26,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3459 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2026, Invalid=9104, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:16:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-08-05 10:16:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 358. [2019-08-05 10:16:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-08-05 10:16:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 409 transitions. [2019-08-05 10:16:26,902 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 409 transitions. Word has length 177 [2019-08-05 10:16:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:26,903 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 409 transitions. [2019-08-05 10:16:26,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 409 transitions. [2019-08-05 10:16:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:16:26,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:26,903 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 14, 12, 12, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:26,904 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -906272096, now seen corresponding path program 86 times [2019-08-05 10:16:26,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:26,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:16:26,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:27,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:27,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 0 proven. 1349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:28,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:28,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:28,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:28,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:28,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2255, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:28,017 INFO L87 Difference]: Start difference. First operand 358 states and 409 transitions. Second operand 53 states. [2019-08-05 10:16:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:30,730 INFO L93 Difference]: Finished difference Result 485 states and 549 transitions. [2019-08-05 10:16:30,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:16:30,730 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 177 [2019-08-05 10:16:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:30,731 INFO L225 Difference]: With dead ends: 485 [2019-08-05 10:16:30,731 INFO L226 Difference]: Without dead ends: 485 [2019-08-05 10:16:30,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3360 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1946, Invalid=8974, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:16:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-08-05 10:16:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 353. [2019-08-05 10:16:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-08-05 10:16:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 404 transitions. [2019-08-05 10:16:30,736 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 404 transitions. Word has length 177 [2019-08-05 10:16:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:30,736 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 404 transitions. [2019-08-05 10:16:30,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 404 transitions. [2019-08-05 10:16:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 10:16:30,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:30,737 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 15, 14, 14, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:30,737 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:30,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:30,737 INFO L82 PathProgramCache]: Analyzing trace with hash -153213614, now seen corresponding path program 87 times [2019-08-05 10:16:30,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:30,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:16:30,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:30,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:30,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:30,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:30,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:30,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:30,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:30,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:31,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:32,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 0 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:32,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:32,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:16:32,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:16:32,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:16:32,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=2426, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:16:32,221 INFO L87 Difference]: Start difference. First operand 353 states and 404 transitions. Second operand 55 states. [2019-08-05 10:16:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:34,759 INFO L93 Difference]: Finished difference Result 967 states and 1083 transitions. [2019-08-05 10:16:34,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:16:34,759 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 181 [2019-08-05 10:16:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:34,761 INFO L225 Difference]: With dead ends: 967 [2019-08-05 10:16:34,761 INFO L226 Difference]: Without dead ends: 967 [2019-08-05 10:16:34,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3928 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2426, Invalid=9784, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:16:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-08-05 10:16:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 644. [2019-08-05 10:16:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-08-05 10:16:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 737 transitions. [2019-08-05 10:16:34,768 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 737 transitions. Word has length 181 [2019-08-05 10:16:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:34,769 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 737 transitions. [2019-08-05 10:16:34,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:16:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 737 transitions. [2019-08-05 10:16:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:16:34,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:34,770 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 15, 13, 13, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:34,771 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1657931205, now seen corresponding path program 88 times [2019-08-05 10:16:34,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:34,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:16:34,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:34,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:34,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:34,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:34,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:35,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 1467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:36,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:36,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:16:36,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:16:36,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:16:36,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2431, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:16:36,071 INFO L87 Difference]: Start difference. First operand 644 states and 737 transitions. Second operand 55 states. [2019-08-05 10:16:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:38,675 INFO L93 Difference]: Finished difference Result 1170 states and 1315 transitions. [2019-08-05 10:16:38,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:16:38,676 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 183 [2019-08-05 10:16:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:38,677 INFO L225 Difference]: With dead ends: 1170 [2019-08-05 10:16:38,677 INFO L226 Difference]: Without dead ends: 1170 [2019-08-05 10:16:38,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2431, Invalid=10001, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:16:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-08-05 10:16:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 602. [2019-08-05 10:16:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-08-05 10:16:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 690 transitions. [2019-08-05 10:16:38,684 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 690 transitions. Word has length 183 [2019-08-05 10:16:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:38,684 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 690 transitions. [2019-08-05 10:16:38,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:16:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 690 transitions. [2019-08-05 10:16:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:16:38,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:38,685 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 15, 13, 13, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1] [2019-08-05 10:16:38,686 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:38,686 INFO L82 PathProgramCache]: Analyzing trace with hash 988242697, now seen corresponding path program 89 times [2019-08-05 10:16:38,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:38,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:16:38,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:38,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:39,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:39,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms Received shutdown request... [2019-08-05 10:16:39,025 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:16:39,026 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:16:39,030 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:16:39,030 INFO L202 PluginConnector]: Adding new model u2b02_multiple_pca_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:16:39 BoogieIcfgContainer [2019-08-05 10:16:39,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:16:39,032 INFO L168 Benchmark]: Toolchain (without parser) took 235777.60 ms. Allocated memory was 141.6 MB in the beginning and 293.1 MB in the end (delta: 151.5 MB). Free memory was 110.8 MB in the beginning and 50.5 MB in the end (delta: 60.3 MB). Peak memory consumption was 211.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,032 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:16:39,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.54 ms. Allocated memory is still 141.6 MB. Free memory was 110.8 MB in the beginning and 108.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,033 INFO L168 Benchmark]: Boogie Preprocessor took 56.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.7 MB in the beginning and 107.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:16:39,034 INFO L168 Benchmark]: RCFGBuilder took 766.37 ms. Allocated memory is still 141.6 MB. Free memory was 107.4 MB in the beginning and 86.1 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,035 INFO L168 Benchmark]: TraceAbstraction took 234905.44 ms. Allocated memory was 141.6 MB in the beginning and 293.1 MB in the end (delta: 151.5 MB). Free memory was 85.7 MB in the beginning and 50.5 MB in the end (delta: 35.2 MB). Peak memory consumption was 186.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,037 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.54 ms. Allocated memory is still 141.6 MB. Free memory was 110.8 MB in the beginning and 108.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.7 MB in the beginning and 107.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.37 ms. Allocated memory is still 141.6 MB. Free memory was 107.4 MB in the beginning and 86.1 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 234905.44 ms. Allocated memory was 141.6 MB in the beginning and 293.1 MB in the end (delta: 151.5 MB). Free memory was 85.7 MB in the beginning and 50.5 MB in the end (delta: 35.2 MB). Peak memory consumption was 186.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 144). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 22,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 103). Cancelled while BasicCegarLoop was analyzing trace of length 184 with TraceHistMax 22,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 2 error locations. TIMEOUT Result, 234.8s OverallTime, 98 OverallIterations, 22 TraceHistogramMax, 148.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1849 SDtfs, 47919 SDslu, 30460 SDs, 0 SdLazy, 40003 SolverSat, 14214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13871 GetRequests, 7585 SyntacticMatches, 2 SemanticMatches, 6284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154323 ImplicationChecksByTransitivity, 170.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=96, 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.5s AutomataMinimizationTime, 97 MinimizatonAttempts, 15283 StatesRemovedByMinimization, 94 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 81.8s InterpolantComputationTime, 10821 NumberOfCodeBlocks, 10821 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 10724 ConstructedInterpolants, 0 QuantifiedInterpolants, 12748441 SizeOfPredicates, 3533 NumberOfNonLiveVariables, 31818 ConjunctsInSsa, 6003 ConjunctsInUnsatCore, 97 InterpolantComputations, 6 PerfectInterpolantSequences, 39/61522 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown