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/u2b08_batman_intermittent_power_1slot_UNSAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:12:45,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:12:45,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:12:45,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:12:45,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:12:45,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:12:45,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:12:45,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:12:45,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:12:45,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:12:45,275 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:12:45,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:12:45,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:12:45,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:12:45,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:12:45,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:12:45,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:12:45,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:12:45,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:12:45,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:12:45,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:12:45,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:12:45,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:12:45,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:12:45,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:12:45,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:12:45,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:12:45,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:12:45,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:12:45,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:12:45,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:12:45,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:12:45,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:12:45,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:12:45,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:12:45,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:12:45,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:12:45,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:12:45,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:12:45,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:12:45,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:12:45,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:12:45,393 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:12:45,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:12:45,399 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:12:45,400 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:12:45,401 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b08_batman_intermittent_power_1slot_UNSAFE.bpl [2019-08-05 10:12:45,401 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b08_batman_intermittent_power_1slot_UNSAFE.bpl' [2019-08-05 10:12:45,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:12:45,518 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:12:45,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:45,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:12:45,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:12:45,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,584 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:12:45,584 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:12:45,584 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:12:45,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:45,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:12:45,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:12:45,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:12:45,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/1) ... [2019-08-05 10:12:45,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:12:45,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:12:45,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:12:45,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:12:45,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (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:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:12:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:12:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:12:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:12:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:12:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:12:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:12:45,759 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:12:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:12:45,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:12:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:12:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:12:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:12:45,934 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:12:49,329 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:12:49,329 INFO L283 CfgBuilder]: Removed 29 assume(true) statements. [2019-08-05 10:12:49,331 INFO L202 PluginConnector]: Adding new model u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:49 BoogieIcfgContainer [2019-08-05 10:12:49,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:12:49,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:12:49,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:12:49,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:12:49,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:45" (1/2) ... [2019-08-05 10:12:49,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6d9ece and model type u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:12:49, skipping insertion in model container [2019-08-05 10:12:49,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:49" (2/2) ... [2019-08-05 10:12:49,339 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b08_batman_intermittent_power_1slot_UNSAFE.bpl [2019-08-05 10:12:49,349 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:12:49,375 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:12:49,391 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:12:49,417 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:12:49,418 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:12:49,418 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:12:49,418 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:12:49,418 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:12:49,419 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:12:49,419 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:12:49,420 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:12:49,420 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:12:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-08-05 10:12:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:12:49,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:49,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:12:49,447 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 19068, now seen corresponding path program 1 times [2019-08-05 10:12:49,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:49,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:49,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:49,659 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:49,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:12:49,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:49,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:49,683 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-08-05 10:12:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:49,777 INFO L93 Difference]: Finished difference Result 69 states and 131 transitions. [2019-08-05 10:12:49,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:49,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:12:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:49,795 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:12:49,795 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:12:49,797 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:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:12:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:12:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:12:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 121 transitions. [2019-08-05 10:12:49,843 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 121 transitions. Word has length 2 [2019-08-05 10:12:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:49,843 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 121 transitions. [2019-08-05 10:12:49,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 121 transitions. [2019-08-05 10:12:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:12:49,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:49,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:12:49,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1051522771, now seen corresponding path program 1 times [2019-08-05 10:12:49,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:49,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:49,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:49,976 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:49,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:49,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:49,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:49,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:49,979 INFO L87 Difference]: Start difference. First operand 67 states and 121 transitions. Second operand 3 states. [2019-08-05 10:12:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:50,311 INFO L93 Difference]: Finished difference Result 121 states and 205 transitions. [2019-08-05 10:12:50,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:50,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 10:12:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:50,315 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:12:50,315 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:12:50,316 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:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:12:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2019-08-05 10:12:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:12:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 204 transitions. [2019-08-05 10:12:50,331 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 204 transitions. Word has length 6 [2019-08-05 10:12:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:50,331 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 204 transitions. [2019-08-05 10:12:50,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 204 transitions. [2019-08-05 10:12:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:12:50,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:50,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:50,333 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1269290875, now seen corresponding path program 1 times [2019-08-05 10:12:50,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:50,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:50,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:50,418 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:50,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:50,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:50,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:50,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:50,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:50,420 INFO L87 Difference]: Start difference. First operand 118 states and 204 transitions. Second operand 3 states. [2019-08-05 10:12:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:50,717 INFO L93 Difference]: Finished difference Result 230 states and 382 transitions. [2019-08-05 10:12:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:50,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:12:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:50,725 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:12:50,727 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:12:50,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:12:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2019-08-05 10:12:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:12:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 374 transitions. [2019-08-05 10:12:50,764 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 374 transitions. Word has length 19 [2019-08-05 10:12:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:50,764 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 374 transitions. [2019-08-05 10:12:50,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 374 transitions. [2019-08-05 10:12:50,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:12:50,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:50,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:50,768 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:50,769 INFO L82 PathProgramCache]: Analyzing trace with hash 122097530, now seen corresponding path program 1 times [2019-08-05 10:12:50,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:50,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:50,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:50,855 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:50,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:50,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:50,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:50,857 INFO L87 Difference]: Start difference. First operand 220 states and 374 transitions. Second operand 3 states. [2019-08-05 10:12:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:51,199 INFO L93 Difference]: Finished difference Result 402 states and 638 transitions. [2019-08-05 10:12:51,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:51,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-08-05 10:12:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:51,204 INFO L225 Difference]: With dead ends: 402 [2019-08-05 10:12:51,205 INFO L226 Difference]: Without dead ends: 402 [2019-08-05 10:12:51,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-08-05 10:12:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 396. [2019-08-05 10:12:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-08-05 10:12:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 634 transitions. [2019-08-05 10:12:51,230 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 634 transitions. Word has length 24 [2019-08-05 10:12:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:51,230 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 634 transitions. [2019-08-05 10:12:51,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 634 transitions. [2019-08-05 10:12:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:12:51,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:51,232 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:51,232 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1533280950, now seen corresponding path program 1 times [2019-08-05 10:12:51,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:51,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:12:51,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:51,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,593 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:12:51,684 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:51,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:51,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:51,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:12:51,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:12:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:12:51,686 INFO L87 Difference]: Start difference. First operand 396 states and 634 transitions. Second operand 5 states. [2019-08-05 10:12:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:51,835 INFO L93 Difference]: Finished difference Result 436 states and 676 transitions. [2019-08-05 10:12:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:51,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-08-05 10:12:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:51,840 INFO L225 Difference]: With dead ends: 436 [2019-08-05 10:12:51,840 INFO L226 Difference]: Without dead ends: 436 [2019-08-05 10:12:51,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-08-05 10:12:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2019-08-05 10:12:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:12:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 676 transitions. [2019-08-05 10:12:51,860 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 676 transitions. Word has length 33 [2019-08-05 10:12:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:51,861 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 676 transitions. [2019-08-05 10:12:51,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:12:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 676 transitions. [2019-08-05 10:12:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:12:51,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:51,864 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:51,864 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:51,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1664810407, now seen corresponding path program 1 times [2019-08-05 10:12:51,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:51,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:51,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:51,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:51,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:51,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:51,982 INFO L87 Difference]: Start difference. First operand 436 states and 676 transitions. Second operand 3 states. [2019-08-05 10:12:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:52,388 INFO L93 Difference]: Finished difference Result 614 states and 924 transitions. [2019-08-05 10:12:52,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:52,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-08-05 10:12:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:52,393 INFO L225 Difference]: With dead ends: 614 [2019-08-05 10:12:52,393 INFO L226 Difference]: Without dead ends: 614 [2019-08-05 10:12:52,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-08-05 10:12:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2019-08-05 10:12:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-08-05 10:12:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 924 transitions. [2019-08-05 10:12:52,409 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 924 transitions. Word has length 54 [2019-08-05 10:12:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:52,410 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 924 transitions. [2019-08-05 10:12:52,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 924 transitions. [2019-08-05 10:12:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:12:52,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:52,413 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:52,413 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:52,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1430263716, now seen corresponding path program 1 times [2019-08-05 10:12:52,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:52,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:52,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:52,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:52,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:52,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:52,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:52,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:52,477 INFO L87 Difference]: Start difference. First operand 612 states and 924 transitions. Second operand 3 states. [2019-08-05 10:12:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:52,677 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2019-08-05 10:12:52,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:52,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-08-05 10:12:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:52,686 INFO L225 Difference]: With dead ends: 892 [2019-08-05 10:12:52,687 INFO L226 Difference]: Without dead ends: 892 [2019-08-05 10:12:52,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 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:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-08-05 10:12:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 890. [2019-08-05 10:12:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-08-05 10:12:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1304 transitions. [2019-08-05 10:12:52,706 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1304 transitions. Word has length 58 [2019-08-05 10:12:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:52,706 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1304 transitions. [2019-08-05 10:12:52,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1304 transitions. [2019-08-05 10:12:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:12:52,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:52,709 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:52,710 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1683091716, now seen corresponding path program 1 times [2019-08-05 10:12:52,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:52,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:52,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:52,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:52,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:52,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:52,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:52,775 INFO L87 Difference]: Start difference. First operand 890 states and 1304 transitions. Second operand 3 states. [2019-08-05 10:12:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:53,041 INFO L93 Difference]: Finished difference Result 873 states and 1265 transitions. [2019-08-05 10:12:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:53,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-08-05 10:12:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:53,047 INFO L225 Difference]: With dead ends: 873 [2019-08-05 10:12:53,047 INFO L226 Difference]: Without dead ends: 863 [2019-08-05 10:12:53,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-08-05 10:12:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-08-05 10:12:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-08-05 10:12:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1255 transitions. [2019-08-05 10:12:53,068 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1255 transitions. Word has length 64 [2019-08-05 10:12:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:53,068 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1255 transitions. [2019-08-05 10:12:53,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1255 transitions. [2019-08-05 10:12:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:12:53,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:53,071 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:53,071 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash 145318395, now seen corresponding path program 1 times [2019-08-05 10:12:53,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:53,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:12:53,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:53,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,622 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:12:54,225 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:12:54,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,539 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 5 [2019-08-05 10:12:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 10:12:54,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:54,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:54,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:12:54,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:12:54,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:54,573 INFO L87 Difference]: Start difference. First operand 863 states and 1255 transitions. Second operand 6 states. [2019-08-05 10:12:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:55,973 INFO L93 Difference]: Finished difference Result 899 states and 1292 transitions. [2019-08-05 10:12:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:12:55,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-08-05 10:12:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:55,981 INFO L225 Difference]: With dead ends: 899 [2019-08-05 10:12:55,981 INFO L226 Difference]: Without dead ends: 899 [2019-08-05 10:12:55,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:12:55,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-08-05 10:12:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2019-08-05 10:12:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-08-05 10:12:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1292 transitions. [2019-08-05 10:12:56,003 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1292 transitions. Word has length 66 [2019-08-05 10:12:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:56,003 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1292 transitions. [2019-08-05 10:12:56,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1292 transitions. [2019-08-05 10:12:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:12:56,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:56,010 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:56,010 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2066776048, now seen corresponding path program 1 times [2019-08-05 10:12:56,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:56,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:12:56,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:56,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,675 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:12:57,276 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:12:57,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,775 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:12:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:57,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:57,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:57,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:12:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:12:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:57,829 INFO L87 Difference]: Start difference. First operand 899 states and 1292 transitions. Second operand 6 states. [2019-08-05 10:12:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:58,313 INFO L93 Difference]: Finished difference Result 992 states and 1406 transitions. [2019-08-05 10:12:58,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:58,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-08-05 10:12:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:58,322 INFO L225 Difference]: With dead ends: 992 [2019-08-05 10:12:58,322 INFO L226 Difference]: Without dead ends: 992 [2019-08-05 10:12:58,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:12:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-08-05 10:12:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 989. [2019-08-05 10:12:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-08-05 10:12:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1403 transitions. [2019-08-05 10:12:58,351 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1403 transitions. Word has length 66 [2019-08-05 10:12:58,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:58,351 INFO L475 AbstractCegarLoop]: Abstraction has 989 states and 1403 transitions. [2019-08-05 10:12:58,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:12:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1403 transitions. [2019-08-05 10:12:58,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:12:58,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:58,360 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:58,360 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:58,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1757702536, now seen corresponding path program 1 times [2019-08-05 10:12:58,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:58,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:12:58,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:58,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:58,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:12:58,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:12:58,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:12:58,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:58,572 INFO L87 Difference]: Start difference. First operand 989 states and 1403 transitions. Second operand 4 states. [2019-08-05 10:13:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:00,523 INFO L93 Difference]: Finished difference Result 2336 states and 3296 transitions. [2019-08-05 10:13:00,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:00,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-08-05 10:13:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:00,536 INFO L225 Difference]: With dead ends: 2336 [2019-08-05 10:13:00,536 INFO L226 Difference]: Without dead ends: 2336 [2019-08-05 10:13:00,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2019-08-05 10:13:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2021. [2019-08-05 10:13:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-08-05 10:13:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2869 transitions. [2019-08-05 10:13:00,602 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2869 transitions. Word has length 88 [2019-08-05 10:13:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:00,603 INFO L475 AbstractCegarLoop]: Abstraction has 2021 states and 2869 transitions. [2019-08-05 10:13:00,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2869 transitions. [2019-08-05 10:13:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:13:00,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:00,604 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:00,605 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1364453069, now seen corresponding path program 1 times [2019-08-05 10:13:00,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:00,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:00,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-08-05 10:13:00,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:00,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:00,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:00,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:00,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:00,685 INFO L87 Difference]: Start difference. First operand 2021 states and 2869 transitions. Second operand 3 states. [2019-08-05 10:13:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:00,781 INFO L93 Difference]: Finished difference Result 2912 states and 4106 transitions. [2019-08-05 10:13:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:00,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-08-05 10:13:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:00,799 INFO L225 Difference]: With dead ends: 2912 [2019-08-05 10:13:00,799 INFO L226 Difference]: Without dead ends: 2888 [2019-08-05 10:13:00,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 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:13:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-08-05 10:13:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2866. [2019-08-05 10:13:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2019-08-05 10:13:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4061 transitions. [2019-08-05 10:13:00,857 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4061 transitions. Word has length 94 [2019-08-05 10:13:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:00,858 INFO L475 AbstractCegarLoop]: Abstraction has 2866 states and 4061 transitions. [2019-08-05 10:13:00,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4061 transitions. [2019-08-05 10:13:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:13:00,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:00,859 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:00,860 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash 406786751, now seen corresponding path program 1 times [2019-08-05 10:13:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:00,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:13:00,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:01,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,240 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:13:01,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,705 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:13:02,130 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:13:02,536 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:13:02,837 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:13:03,203 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:13:03,409 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:13:03,618 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:13:03,805 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:13:03,962 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:13:04,106 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:13:04,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:13:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 3 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:04,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:04,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:13:04,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:13:04,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:13:04,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:04,176 INFO L87 Difference]: Start difference. First operand 2866 states and 4061 transitions. Second operand 17 states. [2019-08-05 10:13:04,677 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-08-05 10:13:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,879 INFO L93 Difference]: Finished difference Result 3208 states and 4472 transitions. [2019-08-05 10:13:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:13:05,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-08-05 10:13:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,894 INFO L225 Difference]: With dead ends: 3208 [2019-08-05 10:13:05,894 INFO L226 Difference]: Without dead ends: 3208 [2019-08-05 10:13:05,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-08-05 10:13:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3193. [2019-08-05 10:13:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3193 states. [2019-08-05 10:13:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4456 transitions. [2019-08-05 10:13:05,952 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4456 transitions. Word has length 98 [2019-08-05 10:13:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,952 INFO L475 AbstractCegarLoop]: Abstraction has 3193 states and 4456 transitions. [2019-08-05 10:13:05,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:13:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4456 transitions. [2019-08-05 10:13:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:13:05,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,955 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:05,955 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1104345947, now seen corresponding path program 1 times [2019-08-05 10:13:05,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:13:06,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:06,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:06,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:06,468 INFO L87 Difference]: Start difference. First operand 3193 states and 4456 transitions. Second operand 9 states. [2019-08-05 10:13:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,114 INFO L93 Difference]: Finished difference Result 3804 states and 5210 transitions. [2019-08-05 10:13:07,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:13:07,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-08-05 10:13:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,127 INFO L225 Difference]: With dead ends: 3804 [2019-08-05 10:13:07,128 INFO L226 Difference]: Without dead ends: 3804 [2019-08-05 10:13:07,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2019-08-05 10:13:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3576. [2019-08-05 10:13:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3576 states. [2019-08-05 10:13:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 4930 transitions. [2019-08-05 10:13:07,181 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 4930 transitions. Word has length 98 [2019-08-05 10:13:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,181 INFO L475 AbstractCegarLoop]: Abstraction has 3576 states and 4930 transitions. [2019-08-05 10:13:07,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 4930 transitions. [2019-08-05 10:13:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:13:07,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,183 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:07,183 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash 421997565, now seen corresponding path program 1 times [2019-08-05 10:13:07,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-08-05 10:13:07,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:07,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:07,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:07,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:07,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:07,285 INFO L87 Difference]: Start difference. First operand 3576 states and 4930 transitions. Second operand 3 states. [2019-08-05 10:13:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,752 INFO L93 Difference]: Finished difference Result 4719 states and 6364 transitions. [2019-08-05 10:13:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:07,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-08-05 10:13:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,767 INFO L225 Difference]: With dead ends: 4719 [2019-08-05 10:13:07,767 INFO L226 Difference]: Without dead ends: 4719 [2019-08-05 10:13:07,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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:13:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2019-08-05 10:13:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4633. [2019-08-05 10:13:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4633 states. [2019-08-05 10:13:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 6280 transitions. [2019-08-05 10:13:07,831 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 6280 transitions. Word has length 98 [2019-08-05 10:13:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,831 INFO L475 AbstractCegarLoop]: Abstraction has 4633 states and 6280 transitions. [2019-08-05 10:13:07,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 6280 transitions. [2019-08-05 10:13:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:13:07,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,833 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:07,833 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1379499634, now seen corresponding path program 1 times [2019-08-05 10:13:07,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 10:13:08,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:08,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:08,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:08,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:08,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:08,308 INFO L87 Difference]: Start difference. First operand 4633 states and 6280 transitions. Second operand 7 states. [2019-08-05 10:13:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,472 INFO L93 Difference]: Finished difference Result 5118 states and 6873 transitions. [2019-08-05 10:13:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:08,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-08-05 10:13:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,500 INFO L225 Difference]: With dead ends: 5118 [2019-08-05 10:13:08,501 INFO L226 Difference]: Without dead ends: 5118 [2019-08-05 10:13:08,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:08,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2019-08-05 10:13:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5009. [2019-08-05 10:13:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5009 states. [2019-08-05 10:13:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5009 states to 5009 states and 6742 transitions. [2019-08-05 10:13:08,566 INFO L78 Accepts]: Start accepts. Automaton has 5009 states and 6742 transitions. Word has length 104 [2019-08-05 10:13:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,566 INFO L475 AbstractCegarLoop]: Abstraction has 5009 states and 6742 transitions. [2019-08-05 10:13:08,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5009 states and 6742 transitions. [2019-08-05 10:13:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:13:08,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,569 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:08,569 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash -96647265, now seen corresponding path program 1 times [2019-08-05 10:13:08,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 10:13:08,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:08,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:08,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:08,696 INFO L87 Difference]: Start difference. First operand 5009 states and 6742 transitions. Second operand 3 states. [2019-08-05 10:13:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,802 INFO L93 Difference]: Finished difference Result 6126 states and 8149 transitions. [2019-08-05 10:13:08,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:08,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-08-05 10:13:08,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,817 INFO L225 Difference]: With dead ends: 6126 [2019-08-05 10:13:08,817 INFO L226 Difference]: Without dead ends: 6126 [2019-08-05 10:13:08,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 117 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:13:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6126 states. [2019-08-05 10:13:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6126 to 6124. [2019-08-05 10:13:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6124 states. [2019-08-05 10:13:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 8149 transitions. [2019-08-05 10:13:08,889 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 8149 transitions. Word has length 120 [2019-08-05 10:13:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,890 INFO L475 AbstractCegarLoop]: Abstraction has 6124 states and 8149 transitions. [2019-08-05 10:13:08,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 8149 transitions. [2019-08-05 10:13:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:13:08,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,892 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:08,892 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash 84980309, now seen corresponding path program 1 times [2019-08-05 10:13:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,603 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 7 [2019-08-05 10:13:09,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:13:09,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:13:09,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:13:09,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:13:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:13:09,682 INFO L87 Difference]: Start difference. First operand 6124 states and 8149 transitions. Second operand 10 states. [2019-08-05 10:13:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:10,400 INFO L93 Difference]: Finished difference Result 7523 states and 9815 transitions. [2019-08-05 10:13:10,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:13:10,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-08-05 10:13:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:10,420 INFO L225 Difference]: With dead ends: 7523 [2019-08-05 10:13:10,421 INFO L226 Difference]: Without dead ends: 7523 [2019-08-05 10:13:10,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:13:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7523 states. [2019-08-05 10:13:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7523 to 6157. [2019-08-05 10:13:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6157 states. [2019-08-05 10:13:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 8184 transitions. [2019-08-05 10:13:10,509 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 8184 transitions. Word has length 124 [2019-08-05 10:13:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:10,509 INFO L475 AbstractCegarLoop]: Abstraction has 6157 states and 8184 transitions. [2019-08-05 10:13:10,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:13:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 8184 transitions. [2019-08-05 10:13:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:13:10,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:10,513 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:10,513 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1463990326, now seen corresponding path program 1 times [2019-08-05 10:13:10,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:10,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:10,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-08-05 10:13:10,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:10,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:10,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:10,672 INFO L87 Difference]: Start difference. First operand 6157 states and 8184 transitions. Second operand 3 states. [2019-08-05 10:13:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:10,914 INFO L93 Difference]: Finished difference Result 7248 states and 9566 transitions. [2019-08-05 10:13:10,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:10,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-08-05 10:13:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:10,924 INFO L225 Difference]: With dead ends: 7248 [2019-08-05 10:13:10,924 INFO L226 Difference]: Without dead ends: 7248 [2019-08-05 10:13:10,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 125 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:13:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2019-08-05 10:13:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 7246. [2019-08-05 10:13:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7246 states. [2019-08-05 10:13:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7246 states to 7246 states and 9566 transitions. [2019-08-05 10:13:11,017 INFO L78 Accepts]: Start accepts. Automaton has 7246 states and 9566 transitions. Word has length 128 [2019-08-05 10:13:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:11,018 INFO L475 AbstractCegarLoop]: Abstraction has 7246 states and 9566 transitions. [2019-08-05 10:13:11,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 7246 states and 9566 transitions. [2019-08-05 10:13:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:13:11,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:11,020 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:11,021 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:11,021 INFO L82 PathProgramCache]: Analyzing trace with hash -200423587, now seen corresponding path program 1 times [2019-08-05 10:13:11,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:11,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:13:11,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:11,210 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:11,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,144 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 9 [2019-08-05 10:13:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 31 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:12,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:12,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:13:12,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:13:12,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:13:12,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:13:12,178 INFO L87 Difference]: Start difference. First operand 7246 states and 9566 transitions. Second operand 10 states. [2019-08-05 10:13:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,788 INFO L93 Difference]: Finished difference Result 7836 states and 10230 transitions. [2019-08-05 10:13:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:13:12,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-08-05 10:13:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,799 INFO L225 Difference]: With dead ends: 7836 [2019-08-05 10:13:12,799 INFO L226 Difference]: Without dead ends: 7836 [2019-08-05 10:13:12,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2019-08-05 10:13:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 7746. [2019-08-05 10:13:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7746 states. [2019-08-05 10:13:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7746 states to 7746 states and 10140 transitions. [2019-08-05 10:13:12,942 INFO L78 Accepts]: Start accepts. Automaton has 7746 states and 10140 transitions. Word has length 129 [2019-08-05 10:13:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,943 INFO L475 AbstractCegarLoop]: Abstraction has 7746 states and 10140 transitions. [2019-08-05 10:13:12,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:13:12,943 INFO L276 IsEmpty]: Start isEmpty. Operand 7746 states and 10140 transitions. [2019-08-05 10:13:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:13:12,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:12,946 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:12,946 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1342186509, now seen corresponding path program 1 times [2019-08-05 10:13:12,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:12,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:12,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-08-05 10:13:13,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:13,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:13,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:13,055 INFO L87 Difference]: Start difference. First operand 7746 states and 10140 transitions. Second operand 3 states. [2019-08-05 10:13:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:13,388 INFO L93 Difference]: Finished difference Result 8770 states and 11449 transitions. [2019-08-05 10:13:13,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:13,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-08-05 10:13:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:13,399 INFO L225 Difference]: With dead ends: 8770 [2019-08-05 10:13:13,399 INFO L226 Difference]: Without dead ends: 8770 [2019-08-05 10:13:13,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 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:13:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8770 states. [2019-08-05 10:13:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8770 to 8319. [2019-08-05 10:13:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8319 states. [2019-08-05 10:13:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8319 states to 8319 states and 10872 transitions. [2019-08-05 10:13:13,492 INFO L78 Accepts]: Start accepts. Automaton has 8319 states and 10872 transitions. Word has length 130 [2019-08-05 10:13:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:13,493 INFO L475 AbstractCegarLoop]: Abstraction has 8319 states and 10872 transitions. [2019-08-05 10:13:13,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8319 states and 10872 transitions. [2019-08-05 10:13:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:13:13,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:13,496 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:13,497 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:13,497 INFO L82 PathProgramCache]: Analyzing trace with hash -813703229, now seen corresponding path program 1 times [2019-08-05 10:13:13,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:13,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:13:13,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:13,677 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:13,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,681 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,288 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:13:14,706 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:13:14,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,912 WARN L188 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:13:16,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 10:13:16,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:16,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:16,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:16,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:16,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:16,190 INFO L87 Difference]: Start difference. First operand 8319 states and 10872 transitions. Second operand 8 states. [2019-08-05 10:13:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:16,536 INFO L93 Difference]: Finished difference Result 9452 states and 12229 transitions. [2019-08-05 10:13:16,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:13:16,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-08-05 10:13:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:16,545 INFO L225 Difference]: With dead ends: 9452 [2019-08-05 10:13:16,546 INFO L226 Difference]: Without dead ends: 9452 [2019-08-05 10:13:16,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2019-08-05 10:13:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 8665. [2019-08-05 10:13:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2019-08-05 10:13:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 11296 transitions. [2019-08-05 10:13:16,635 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 11296 transitions. Word has length 133 [2019-08-05 10:13:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:16,636 INFO L475 AbstractCegarLoop]: Abstraction has 8665 states and 11296 transitions. [2019-08-05 10:13:16,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 11296 transitions. [2019-08-05 10:13:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:13:16,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:16,638 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:16,639 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2133305053, now seen corresponding path program 1 times [2019-08-05 10:13:16,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:16,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:13:16,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:16,856 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:16,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,304 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 10 [2019-08-05 10:13:17,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,963 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 10 [2019-08-05 10:13:18,640 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 10 [2019-08-05 10:13:18,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:18,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,398 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-08-05 10:13:19,800 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-08-05 10:13:20,140 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-08-05 10:13:20,506 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-08-05 10:13:20,875 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-08-05 10:13:21,181 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-08-05 10:13:21,508 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-08-05 10:13:21,710 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-08-05 10:13:21,963 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-08-05 10:13:22,308 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 15 [2019-08-05 10:13:22,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:22,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:22,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:13:22,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:13:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:13:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:22,567 INFO L87 Difference]: Start difference. First operand 8665 states and 11296 transitions. Second operand 21 states. [2019-08-05 10:13:23,398 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-08-05 10:13:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,013 INFO L93 Difference]: Finished difference Result 8972 states and 11638 transitions. [2019-08-05 10:13:25,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:13:25,013 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2019-08-05 10:13:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,020 INFO L225 Difference]: With dead ends: 8972 [2019-08-05 10:13:25,021 INFO L226 Difference]: Without dead ends: 8972 [2019-08-05 10:13:25,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8972 states. [2019-08-05 10:13:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8972 to 8958. [2019-08-05 10:13:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8958 states. [2019-08-05 10:13:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8958 states to 8958 states and 11624 transitions. [2019-08-05 10:13:25,088 INFO L78 Accepts]: Start accepts. Automaton has 8958 states and 11624 transitions. Word has length 135 [2019-08-05 10:13:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,088 INFO L475 AbstractCegarLoop]: Abstraction has 8958 states and 11624 transitions. [2019-08-05 10:13:25,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:13:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8958 states and 11624 transitions. [2019-08-05 10:13:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:13:25,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,091 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:25,091 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1407621207, now seen corresponding path program 1 times [2019-08-05 10:13:25,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-08-05 10:13:25,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:25,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:13:25,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:25,262 INFO L87 Difference]: Start difference. First operand 8958 states and 11624 transitions. Second operand 5 states. [2019-08-05 10:13:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,354 INFO L93 Difference]: Finished difference Result 8957 states and 11478 transitions. [2019-08-05 10:13:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:25,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-08-05 10:13:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,361 INFO L225 Difference]: With dead ends: 8957 [2019-08-05 10:13:25,361 INFO L226 Difference]: Without dead ends: 8957 [2019-08-05 10:13:25,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2019-08-05 10:13:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8631. [2019-08-05 10:13:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8631 states. [2019-08-05 10:13:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8631 states to 8631 states and 11122 transitions. [2019-08-05 10:13:25,469 INFO L78 Accepts]: Start accepts. Automaton has 8631 states and 11122 transitions. Word has length 140 [2019-08-05 10:13:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,469 INFO L475 AbstractCegarLoop]: Abstraction has 8631 states and 11122 transitions. [2019-08-05 10:13:25,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 8631 states and 11122 transitions. [2019-08-05 10:13:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:13:25,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,473 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:25,473 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash -799718882, now seen corresponding path program 1 times [2019-08-05 10:13:25,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 10:13:25,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:25,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:25,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:25,632 INFO L87 Difference]: Start difference. First operand 8631 states and 11122 transitions. Second operand 3 states. [2019-08-05 10:13:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:25,940 INFO L93 Difference]: Finished difference Result 9953 states and 12779 transitions. [2019-08-05 10:13:25,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:25,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-08-05 10:13:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:25,953 INFO L225 Difference]: With dead ends: 9953 [2019-08-05 10:13:25,953 INFO L226 Difference]: Without dead ends: 9886 [2019-08-05 10:13:25,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9886 states. [2019-08-05 10:13:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9886 to 9684. [2019-08-05 10:13:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9684 states. [2019-08-05 10:13:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9684 states to 9684 states and 12485 transitions. [2019-08-05 10:13:26,032 INFO L78 Accepts]: Start accepts. Automaton has 9684 states and 12485 transitions. Word has length 153 [2019-08-05 10:13:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:26,032 INFO L475 AbstractCegarLoop]: Abstraction has 9684 states and 12485 transitions. [2019-08-05 10:13:26,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 9684 states and 12485 transitions. [2019-08-05 10:13:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:13:26,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:26,035 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:26,035 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:26,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash -535857345, now seen corresponding path program 1 times [2019-08-05 10:13:26,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:26,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:26,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 10:13:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:26,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:26,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:26,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:26,157 INFO L87 Difference]: Start difference. First operand 9684 states and 12485 transitions. Second operand 3 states. [2019-08-05 10:13:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:26,405 INFO L93 Difference]: Finished difference Result 12518 states and 16023 transitions. [2019-08-05 10:13:26,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:26,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-08-05 10:13:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:26,424 INFO L225 Difference]: With dead ends: 12518 [2019-08-05 10:13:26,424 INFO L226 Difference]: Without dead ends: 12338 [2019-08-05 10:13:26,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 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:13:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12338 states. [2019-08-05 10:13:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12338 to 12337. [2019-08-05 10:13:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12337 states. [2019-08-05 10:13:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12337 states to 12337 states and 15786 transitions. [2019-08-05 10:13:26,575 INFO L78 Accepts]: Start accepts. Automaton has 12337 states and 15786 transitions. Word has length 157 [2019-08-05 10:13:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:26,576 INFO L475 AbstractCegarLoop]: Abstraction has 12337 states and 15786 transitions. [2019-08-05 10:13:26,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12337 states and 15786 transitions. [2019-08-05 10:13:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:13:26,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:26,580 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:26,580 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -226374237, now seen corresponding path program 1 times [2019-08-05 10:13:26,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:26,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:13:26,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:26,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,652 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 7 [2019-08-05 10:13:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 31 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:27,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:27,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:13:27,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:13:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:13:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:27,770 INFO L87 Difference]: Start difference. First operand 12337 states and 15786 transitions. Second operand 11 states. [2019-08-05 10:13:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,758 INFO L93 Difference]: Finished difference Result 12585 states and 16063 transitions. [2019-08-05 10:13:28,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:13:28,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 158 [2019-08-05 10:13:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,776 INFO L225 Difference]: With dead ends: 12585 [2019-08-05 10:13:28,776 INFO L226 Difference]: Without dead ends: 12585 [2019-08-05 10:13:28,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:13:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12585 states. [2019-08-05 10:13:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12585 to 12110. [2019-08-05 10:13:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12110 states. [2019-08-05 10:13:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12110 states to 12110 states and 15528 transitions. [2019-08-05 10:13:28,927 INFO L78 Accepts]: Start accepts. Automaton has 12110 states and 15528 transitions. Word has length 158 [2019-08-05 10:13:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,927 INFO L475 AbstractCegarLoop]: Abstraction has 12110 states and 15528 transitions. [2019-08-05 10:13:28,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:13:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 12110 states and 15528 transitions. [2019-08-05 10:13:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 10:13:28,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,931 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:28,932 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash -17059966, now seen corresponding path program 1 times [2019-08-05 10:13:28,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:28,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:13:28,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 138 proven. 69 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-08-05 10:13:29,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:29,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:29,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:29,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:29,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:29,529 INFO L87 Difference]: Start difference. First operand 12110 states and 15528 transitions. Second operand 7 states. [2019-08-05 10:13:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:29,827 INFO L93 Difference]: Finished difference Result 13294 states and 17238 transitions. [2019-08-05 10:13:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:13:29,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-08-05 10:13:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:29,838 INFO L225 Difference]: With dead ends: 13294 [2019-08-05 10:13:29,838 INFO L226 Difference]: Without dead ends: 13225 [2019-08-05 10:13:29,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13225 states. [2019-08-05 10:13:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13225 to 12811. [2019-08-05 10:13:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12811 states. [2019-08-05 10:13:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12811 states to 12811 states and 16659 transitions. [2019-08-05 10:13:29,936 INFO L78 Accepts]: Start accepts. Automaton has 12811 states and 16659 transitions. Word has length 159 [2019-08-05 10:13:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:29,936 INFO L475 AbstractCegarLoop]: Abstraction has 12811 states and 16659 transitions. [2019-08-05 10:13:29,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12811 states and 16659 transitions. [2019-08-05 10:13:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 10:13:29,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:29,939 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:29,939 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1170277415, now seen corresponding path program 1 times [2019-08-05 10:13:29,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:29,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:13:29,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:30,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,092 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-08-05 10:13:31,436 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-08-05 10:13:31,728 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-08-05 10:13:31,989 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:13:32,234 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-08-05 10:13:32,454 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-08-05 10:13:32,652 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:13:32,866 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:13:33,007 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:13:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 10:13:33,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:33,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:13:33,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:13:33,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:13:33,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:13:33,119 INFO L87 Difference]: Start difference. First operand 12811 states and 16659 transitions. Second operand 18 states. [2019-08-05 10:13:33,798 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-08-05 10:13:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:34,623 INFO L93 Difference]: Finished difference Result 20329 states and 26195 transitions. [2019-08-05 10:13:34,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:13:34,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 161 [2019-08-05 10:13:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:34,640 INFO L225 Difference]: With dead ends: 20329 [2019-08-05 10:13:34,640 INFO L226 Difference]: Without dead ends: 20133 [2019-08-05 10:13:34,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20133 states. [2019-08-05 10:13:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20133 to 16854. [2019-08-05 10:13:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16854 states. [2019-08-05 10:13:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16854 states to 16854 states and 22058 transitions. [2019-08-05 10:13:34,846 INFO L78 Accepts]: Start accepts. Automaton has 16854 states and 22058 transitions. Word has length 161 [2019-08-05 10:13:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:34,847 INFO L475 AbstractCegarLoop]: Abstraction has 16854 states and 22058 transitions. [2019-08-05 10:13:34,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:13:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 16854 states and 22058 transitions. [2019-08-05 10:13:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:13:34,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:34,849 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:34,850 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:34,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash 203280071, now seen corresponding path program 2 times [2019-08-05 10:13:34,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:34,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:13:34,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:35,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,555 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-08-05 10:13:35,856 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-08-05 10:13:36,193 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-08-05 10:13:36,487 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:13:36,729 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-08-05 10:13:36,940 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-08-05 10:13:37,128 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:13:37,294 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:13:37,430 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:13:37,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:37,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:37,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:13:37,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:13:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:13:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:37,805 INFO L87 Difference]: Start difference. First operand 16854 states and 22058 transitions. Second operand 23 states. [2019-08-05 10:13:41,404 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-08-05 10:13:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:41,974 INFO L93 Difference]: Finished difference Result 24131 states and 31138 transitions. [2019-08-05 10:13:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:13:41,975 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 163 [2019-08-05 10:13:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:41,997 INFO L225 Difference]: With dead ends: 24131 [2019-08-05 10:13:41,997 INFO L226 Difference]: Without dead ends: 24131 [2019-08-05 10:13:41,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=387, Invalid=1419, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:13:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24131 states. [2019-08-05 10:13:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24131 to 17764. [2019-08-05 10:13:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17764 states. [2019-08-05 10:13:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17764 states to 17764 states and 23356 transitions. [2019-08-05 10:13:42,158 INFO L78 Accepts]: Start accepts. Automaton has 17764 states and 23356 transitions. Word has length 163 [2019-08-05 10:13:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:42,158 INFO L475 AbstractCegarLoop]: Abstraction has 17764 states and 23356 transitions. [2019-08-05 10:13:42,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:13:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 17764 states and 23356 transitions. [2019-08-05 10:13:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:13:42,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:42,160 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:42,161 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash -689649051, now seen corresponding path program 3 times [2019-08-05 10:13:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:42,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:13:42,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:42,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,646 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:13:42,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,134 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:13:43,390 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:13:43,630 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:13:43,852 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:13:44,055 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:13:44,236 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:13:44,425 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:13:44,575 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:13:44,720 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:13:44,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:13:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 35 proven. 213 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 10:13:44,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:44,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:13:44,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:13:44,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:13:44,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:13:44,846 INFO L87 Difference]: Start difference. First operand 17764 states and 23356 transitions. Second operand 18 states. [2019-08-05 10:13:45,186 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-08-05 10:13:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:46,268 INFO L93 Difference]: Finished difference Result 21044 states and 27314 transitions. [2019-08-05 10:13:46,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:13:46,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 163 [2019-08-05 10:13:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:46,285 INFO L225 Difference]: With dead ends: 21044 [2019-08-05 10:13:46,285 INFO L226 Difference]: Without dead ends: 21044 [2019-08-05 10:13:46,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21044 states. [2019-08-05 10:13:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21044 to 19211. [2019-08-05 10:13:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19211 states. [2019-08-05 10:13:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19211 states to 19211 states and 25121 transitions. [2019-08-05 10:13:47,085 INFO L78 Accepts]: Start accepts. Automaton has 19211 states and 25121 transitions. Word has length 163 [2019-08-05 10:13:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:47,086 INFO L475 AbstractCegarLoop]: Abstraction has 19211 states and 25121 transitions. [2019-08-05 10:13:47,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:13:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 19211 states and 25121 transitions. [2019-08-05 10:13:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:13:47,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:47,088 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:47,088 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1175479953, now seen corresponding path program 4 times [2019-08-05 10:13:47,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:47,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:13:47,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:47,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,335 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 13 [2019-08-05 10:13:47,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,182 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-08-05 10:13:48,519 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-08-05 10:13:48,830 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-08-05 10:13:49,104 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:13:49,356 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-08-05 10:13:49,579 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-08-05 10:13:49,777 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:13:49,942 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:13:50,089 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:13:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 30 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:50,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:50,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:13:50,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:13:50,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:13:50,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:13:50,204 INFO L87 Difference]: Start difference. First operand 19211 states and 25121 transitions. Second operand 19 states. [2019-08-05 10:13:50,851 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-08-05 10:13:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:51,716 INFO L93 Difference]: Finished difference Result 23567 states and 30399 transitions. [2019-08-05 10:13:51,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:13:51,717 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 163 [2019-08-05 10:13:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:51,735 INFO L225 Difference]: With dead ends: 23567 [2019-08-05 10:13:51,735 INFO L226 Difference]: Without dead ends: 23567 [2019-08-05 10:13:51,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=181, Invalid=281, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23567 states. [2019-08-05 10:13:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23567 to 19355. [2019-08-05 10:13:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19355 states. [2019-08-05 10:13:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19355 states to 19355 states and 25273 transitions. [2019-08-05 10:13:51,958 INFO L78 Accepts]: Start accepts. Automaton has 19355 states and 25273 transitions. Word has length 163 [2019-08-05 10:13:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:51,959 INFO L475 AbstractCegarLoop]: Abstraction has 19355 states and 25273 transitions. [2019-08-05 10:13:51,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:13:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 19355 states and 25273 transitions. [2019-08-05 10:13:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:13:51,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:51,961 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:51,961 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:51,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1644868326, now seen corresponding path program 2 times [2019-08-05 10:13:51,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:52,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:13:52,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:52,133 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:52,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,623 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 8 [2019-08-05 10:13:53,191 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 8 [2019-08-05 10:13:53,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,770 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-08-05 10:13:54,067 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:13:54,338 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 10:13:54,595 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:13:54,832 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:13:55,047 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-08-05 10:13:55,241 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-08-05 10:13:55,419 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:13:55,574 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:13:55,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 32 proven. 239 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:55,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:55,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:13:55,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:13:55,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:13:55,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:55,972 INFO L87 Difference]: Start difference. First operand 19355 states and 25273 transitions. Second operand 24 states. [2019-08-05 10:13:57,117 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-08-05 10:13:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:58,926 INFO L93 Difference]: Finished difference Result 22130 states and 28815 transitions. [2019-08-05 10:13:58,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:13:58,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 164 [2019-08-05 10:13:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:58,944 INFO L225 Difference]: With dead ends: 22130 [2019-08-05 10:13:58,944 INFO L226 Difference]: Without dead ends: 22130 [2019-08-05 10:13:58,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:13:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22130 states. [2019-08-05 10:13:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22130 to 20872. [2019-08-05 10:13:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20872 states. [2019-08-05 10:13:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20872 states to 20872 states and 27271 transitions. [2019-08-05 10:13:59,107 INFO L78 Accepts]: Start accepts. Automaton has 20872 states and 27271 transitions. Word has length 164 [2019-08-05 10:13:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:59,108 INFO L475 AbstractCegarLoop]: Abstraction has 20872 states and 27271 transitions. [2019-08-05 10:13:59,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:13:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 20872 states and 27271 transitions. [2019-08-05 10:13:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:13:59,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:59,111 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:59,112 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash -356217092, now seen corresponding path program 5 times [2019-08-05 10:13:59,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:59,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:13:59,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:59,296 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:59,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 36 proven. 246 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:13:59,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:59,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:13:59,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:13:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:13:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:59,954 INFO L87 Difference]: Start difference. First operand 20872 states and 27271 transitions. Second operand 12 states. [2019-08-05 10:14:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:00,679 INFO L93 Difference]: Finished difference Result 21573 states and 28076 transitions. [2019-08-05 10:14:00,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:00,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-08-05 10:14:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:00,696 INFO L225 Difference]: With dead ends: 21573 [2019-08-05 10:14:00,697 INFO L226 Difference]: Without dead ends: 21573 [2019-08-05 10:14:00,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:14:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21573 states. [2019-08-05 10:14:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21573 to 21041. [2019-08-05 10:14:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21041 states. [2019-08-05 10:14:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21041 states to 21041 states and 27453 transitions. [2019-08-05 10:14:00,857 INFO L78 Accepts]: Start accepts. Automaton has 21041 states and 27453 transitions. Word has length 164 [2019-08-05 10:14:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:00,857 INFO L475 AbstractCegarLoop]: Abstraction has 21041 states and 27453 transitions. [2019-08-05 10:14:00,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:14:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21041 states and 27453 transitions. [2019-08-05 10:14:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:14:00,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:00,859 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:00,859 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1555542485, now seen corresponding path program 1 times [2019-08-05 10:14:00,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:00,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:14:00,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 119 proven. 133 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 10:14:01,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:01,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:14:01,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:14:01,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:14:01,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:14:01,030 INFO L87 Difference]: Start difference. First operand 21041 states and 27453 transitions. Second operand 6 states. [2019-08-05 10:14:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:01,569 INFO L93 Difference]: Finished difference Result 30370 states and 39493 transitions. [2019-08-05 10:14:01,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:14:01,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-08-05 10:14:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:01,597 INFO L225 Difference]: With dead ends: 30370 [2019-08-05 10:14:01,597 INFO L226 Difference]: Without dead ends: 30370 [2019-08-05 10:14:01,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30370 states. [2019-08-05 10:14:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30370 to 19573. [2019-08-05 10:14:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19573 states. [2019-08-05 10:14:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19573 states to 19573 states and 25694 transitions. [2019-08-05 10:14:01,780 INFO L78 Accepts]: Start accepts. Automaton has 19573 states and 25694 transitions. Word has length 164 [2019-08-05 10:14:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:01,781 INFO L475 AbstractCegarLoop]: Abstraction has 19573 states and 25694 transitions. [2019-08-05 10:14:01,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:14:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 19573 states and 25694 transitions. [2019-08-05 10:14:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:14:01,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:01,783 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:01,783 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1628207184, now seen corresponding path program 6 times [2019-08-05 10:14:01,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:01,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:14:01,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:01,998 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:14:02,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,177 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 13 [2019-08-05 10:14:02,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 31 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:02,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:02,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:14:02,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:14:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:14:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:14:02,832 INFO L87 Difference]: Start difference. First operand 19573 states and 25694 transitions. Second operand 12 states. [2019-08-05 10:14:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:04,080 INFO L93 Difference]: Finished difference Result 22259 states and 28934 transitions. [2019-08-05 10:14:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:14:04,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-08-05 10:14:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:04,099 INFO L225 Difference]: With dead ends: 22259 [2019-08-05 10:14:04,099 INFO L226 Difference]: Without dead ends: 22259 [2019-08-05 10:14:04,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:14:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22259 states. [2019-08-05 10:14:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22259 to 20303. [2019-08-05 10:14:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20303 states. [2019-08-05 10:14:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20303 states to 20303 states and 26587 transitions. [2019-08-05 10:14:04,245 INFO L78 Accepts]: Start accepts. Automaton has 20303 states and 26587 transitions. Word has length 164 [2019-08-05 10:14:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:04,245 INFO L475 AbstractCegarLoop]: Abstraction has 20303 states and 26587 transitions. [2019-08-05 10:14:04,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:14:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 20303 states and 26587 transitions. [2019-08-05 10:14:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:14:04,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:04,247 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:04,247 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1480325457, now seen corresponding path program 3 times [2019-08-05 10:14:04,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:04,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:14:04,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:04,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 36 proven. 226 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:14:04,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:04,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:14:04,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:14:04,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:14:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:14:04,871 INFO L87 Difference]: Start difference. First operand 20303 states and 26587 transitions. Second operand 13 states. [2019-08-05 10:14:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:05,503 INFO L93 Difference]: Finished difference Result 25675 states and 33223 transitions. [2019-08-05 10:14:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:14:05,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 165 [2019-08-05 10:14:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:05,524 INFO L225 Difference]: With dead ends: 25675 [2019-08-05 10:14:05,524 INFO L226 Difference]: Without dead ends: 25675 [2019-08-05 10:14:05,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:14:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25675 states. [2019-08-05 10:14:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25675 to 22373. [2019-08-05 10:14:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22373 states. [2019-08-05 10:14:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22373 states to 22373 states and 29189 transitions. [2019-08-05 10:14:05,801 INFO L78 Accepts]: Start accepts. Automaton has 22373 states and 29189 transitions. Word has length 165 [2019-08-05 10:14:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:05,801 INFO L475 AbstractCegarLoop]: Abstraction has 22373 states and 29189 transitions. [2019-08-05 10:14:05,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:14:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 22373 states and 29189 transitions. [2019-08-05 10:14:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 10:14:05,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:05,804 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:05,805 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1427031427, now seen corresponding path program 4 times [2019-08-05 10:14:05,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:05,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:14:05,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:05,979 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:14:05,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 31 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:06,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:06,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:14:06,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:14:06,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:14:06,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:14:06,938 INFO L87 Difference]: Start difference. First operand 22373 states and 29189 transitions. Second operand 18 states. [2019-08-05 10:14:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:09,165 INFO L93 Difference]: Finished difference Result 23065 states and 29987 transitions. [2019-08-05 10:14:09,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:14:09,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 165 [2019-08-05 10:14:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:09,184 INFO L225 Difference]: With dead ends: 23065 [2019-08-05 10:14:09,184 INFO L226 Difference]: Without dead ends: 23065 [2019-08-05 10:14:09,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=337, Invalid=1303, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23065 states. [2019-08-05 10:14:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23065 to 22638. [2019-08-05 10:14:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22638 states. [2019-08-05 10:14:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22638 states to 22638 states and 29491 transitions. [2019-08-05 10:14:09,341 INFO L78 Accepts]: Start accepts. Automaton has 22638 states and 29491 transitions. Word has length 165 [2019-08-05 10:14:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:09,341 INFO L475 AbstractCegarLoop]: Abstraction has 22638 states and 29491 transitions. [2019-08-05 10:14:09,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:14:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 22638 states and 29491 transitions. [2019-08-05 10:14:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:14:09,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:09,344 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:09,344 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1912536248, now seen corresponding path program 1 times [2019-08-05 10:14:09,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:09,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:14:09,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:09,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 263 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-08-05 10:14:10,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:10,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:14:10,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:14:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:14:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:14:10,052 INFO L87 Difference]: Start difference. First operand 22638 states and 29491 transitions. Second operand 9 states. [2019-08-05 10:14:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:10,528 INFO L93 Difference]: Finished difference Result 22837 states and 29713 transitions. [2019-08-05 10:14:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:14:10,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 166 [2019-08-05 10:14:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:10,546 INFO L225 Difference]: With dead ends: 22837 [2019-08-05 10:14:10,546 INFO L226 Difference]: Without dead ends: 22837 [2019-08-05 10:14:10,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:14:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22837 states. [2019-08-05 10:14:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22837 to 22787. [2019-08-05 10:14:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22787 states. [2019-08-05 10:14:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22787 states to 22787 states and 29662 transitions. [2019-08-05 10:14:10,706 INFO L78 Accepts]: Start accepts. Automaton has 22787 states and 29662 transitions. Word has length 166 [2019-08-05 10:14:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:10,706 INFO L475 AbstractCegarLoop]: Abstraction has 22787 states and 29662 transitions. [2019-08-05 10:14:10,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:14:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 22787 states and 29662 transitions. [2019-08-05 10:14:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 10:14:10,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:10,709 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:10,709 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1846286436, now seen corresponding path program 2 times [2019-08-05 10:14:10,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:10,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:14:10,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:10,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:10,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 31 proven. 233 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 10:14:11,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:11,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:14:11,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:14:11,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:14:11,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:14:11,283 INFO L87 Difference]: Start difference. First operand 22787 states and 29662 transitions. Second operand 11 states. [2019-08-05 10:14:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:12,239 INFO L93 Difference]: Finished difference Result 23547 states and 30519 transitions. [2019-08-05 10:14:12,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:14:12,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 166 [2019-08-05 10:14:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:12,259 INFO L225 Difference]: With dead ends: 23547 [2019-08-05 10:14:12,259 INFO L226 Difference]: Without dead ends: 23547 [2019-08-05 10:14:12,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:14:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23547 states. [2019-08-05 10:14:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23547 to 23277. [2019-08-05 10:14:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23277 states. [2019-08-05 10:14:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23277 states to 23277 states and 30217 transitions. [2019-08-05 10:14:12,424 INFO L78 Accepts]: Start accepts. Automaton has 23277 states and 30217 transitions. Word has length 166 [2019-08-05 10:14:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:12,424 INFO L475 AbstractCegarLoop]: Abstraction has 23277 states and 30217 transitions. [2019-08-05 10:14:12,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:14:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23277 states and 30217 transitions. [2019-08-05 10:14:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:14:12,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:12,428 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:12,428 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:12,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:12,428 INFO L82 PathProgramCache]: Analyzing trace with hash 357881894, now seen corresponding path program 1 times [2019-08-05 10:14:12,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:12,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:14:12,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:12,693 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 3 [2019-08-05 10:14:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-08-05 10:14:12,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:12,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:14:12,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:14:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:14:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:14:12,707 INFO L87 Difference]: Start difference. First operand 23277 states and 30217 transitions. Second operand 4 states. [2019-08-05 10:14:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:13,021 INFO L93 Difference]: Finished difference Result 26158 states and 33435 transitions. [2019-08-05 10:14:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:14:13,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-08-05 10:14:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:13,042 INFO L225 Difference]: With dead ends: 26158 [2019-08-05 10:14:13,042 INFO L226 Difference]: Without dead ends: 25650 [2019-08-05 10:14:13,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:14:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25650 states. [2019-08-05 10:14:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25650 to 24745. [2019-08-05 10:14:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24745 states. [2019-08-05 10:14:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24745 states to 24745 states and 32003 transitions. [2019-08-05 10:14:13,215 INFO L78 Accepts]: Start accepts. Automaton has 24745 states and 32003 transitions. Word has length 178 [2019-08-05 10:14:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:13,215 INFO L475 AbstractCegarLoop]: Abstraction has 24745 states and 32003 transitions. [2019-08-05 10:14:13,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:14:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24745 states and 32003 transitions. [2019-08-05 10:14:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:14:13,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:13,218 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:13,218 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:13,219 INFO L82 PathProgramCache]: Analyzing trace with hash 636967137, now seen corresponding path program 1 times [2019-08-05 10:14:13,221 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,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:14:13,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:13,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,376 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,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:13,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,243 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:14:14,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,510 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:14:15,026 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:14:15,293 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:14:15,540 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:14:15,792 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:14:15,987 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:14:16,172 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:14:16,340 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:14:16,490 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:14:16,642 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:14:16,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:14:16,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 12 proven. 287 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-08-05 10:14:16,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:14:16,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:14:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:14:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:16,840 INFO L87 Difference]: Start difference. First operand 24745 states and 32003 transitions. Second operand 21 states. [2019-08-05 10:14:18,257 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:14:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:18,525 INFO L93 Difference]: Finished difference Result 30153 states and 38686 transitions. [2019-08-05 10:14:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:14:18,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2019-08-05 10:14:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:18,551 INFO L225 Difference]: With dead ends: 30153 [2019-08-05 10:14:18,551 INFO L226 Difference]: Without dead ends: 30153 [2019-08-05 10:14:18,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:14:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30153 states. [2019-08-05 10:14:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30153 to 24429. [2019-08-05 10:14:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24429 states. [2019-08-05 10:14:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24429 states to 24429 states and 31630 transitions. [2019-08-05 10:14:18,746 INFO L78 Accepts]: Start accepts. Automaton has 24429 states and 31630 transitions. Word has length 179 [2019-08-05 10:14:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:18,747 INFO L475 AbstractCegarLoop]: Abstraction has 24429 states and 31630 transitions. [2019-08-05 10:14:18,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:14:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24429 states and 31630 transitions. [2019-08-05 10:14:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 10:14:18,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:18,750 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:18,750 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1727825832, now seen corresponding path program 1 times [2019-08-05 10:14:18,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:18,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:14:18,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 200 proven. 24 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-08-05 10:14:18,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:18,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:14:18,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:14:18,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:14:18,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:14:18,859 INFO L87 Difference]: Start difference. First operand 24429 states and 31630 transitions. Second operand 4 states. [2019-08-05 10:14:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:19,083 INFO L93 Difference]: Finished difference Result 29314 states and 37296 transitions. [2019-08-05 10:14:19,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:14:19,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-08-05 10:14:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:19,106 INFO L225 Difference]: With dead ends: 29314 [2019-08-05 10:14:19,107 INFO L226 Difference]: Without dead ends: 28269 [2019-08-05 10:14:19,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:14:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28269 states. [2019-08-05 10:14:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28269 to 27613. [2019-08-05 10:14:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27613 states. [2019-08-05 10:14:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27613 states to 27613 states and 35478 transitions. [2019-08-05 10:14:19,308 INFO L78 Accepts]: Start accepts. Automaton has 27613 states and 35478 transitions. Word has length 180 [2019-08-05 10:14:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:19,309 INFO L475 AbstractCegarLoop]: Abstraction has 27613 states and 35478 transitions. [2019-08-05 10:14:19,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:14:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27613 states and 35478 transitions. [2019-08-05 10:14:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:14:19,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:19,313 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:19,313 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:19,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:19,314 INFO L82 PathProgramCache]: Analyzing trace with hash -504302387, now seen corresponding path program 1 times [2019-08-05 10:14:19,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:19,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:14:19,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:19,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:20,398 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 84 [2019-08-05 10:14:20,710 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2019-08-05 10:14:20,996 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-08-05 10:14:21,260 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-08-05 10:14:21,496 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-08-05 10:14:21,702 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-08-05 10:14:21,888 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:14:22,064 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:14:22,244 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:14:22,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:23,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:23,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:14:23,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:14:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:14:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:14:23,180 INFO L87 Difference]: Start difference. First operand 27613 states and 35478 transitions. Second operand 30 states. [2019-08-05 10:14:23,408 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-08-05 10:14:23,659 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-08-05 10:14:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:34,217 INFO L93 Difference]: Finished difference Result 119574 states and 154099 transitions. [2019-08-05 10:14:34,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:14:34,219 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 187 [2019-08-05 10:14:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:34,345 INFO L225 Difference]: With dead ends: 119574 [2019-08-05 10:14:34,345 INFO L226 Difference]: Without dead ends: 118851 [2019-08-05 10:14:34,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3766 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2463, Invalid=8043, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:14:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118851 states. [2019-08-05 10:14:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118851 to 85187. [2019-08-05 10:14:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85187 states. [2019-08-05 10:14:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85187 states to 85187 states and 112030 transitions. [2019-08-05 10:14:35,159 INFO L78 Accepts]: Start accepts. Automaton has 85187 states and 112030 transitions. Word has length 187 [2019-08-05 10:14:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:35,159 INFO L475 AbstractCegarLoop]: Abstraction has 85187 states and 112030 transitions. [2019-08-05 10:14:35,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:14:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 85187 states and 112030 transitions. [2019-08-05 10:14:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 10:14:35,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:35,165 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:35,165 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:35,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:35,165 INFO L82 PathProgramCache]: Analyzing trace with hash -98949308, now seen corresponding path program 1 times [2019-08-05 10:14:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:35,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:14:35,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:35,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,389 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 13 [2019-08-05 10:14:35,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:35,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,715 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 41 DAG size of output: 10 [2019-08-05 10:14:36,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,127 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 10 [2019-08-05 10:14:37,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,576 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-08-05 10:14:37,943 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-08-05 10:14:38,242 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-08-05 10:14:38,514 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-08-05 10:14:38,758 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-08-05 10:14:38,982 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-08-05 10:14:39,184 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-08-05 10:14:39,363 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-08-05 10:14:39,520 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-08-05 10:14:39,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,711 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 28 [2019-08-05 10:14:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 367 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 10:14:40,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:40,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:14:40,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:14:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:14:40,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:14:40,169 INFO L87 Difference]: Start difference. First operand 85187 states and 112030 transitions. Second operand 26 states. [2019-08-05 10:14:40,892 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-08-05 10:14:41,624 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-08-05 10:14:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:44,280 INFO L93 Difference]: Finished difference Result 163549 states and 211670 transitions. [2019-08-05 10:14:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:14:44,280 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 187 [2019-08-05 10:14:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:44,459 INFO L225 Difference]: With dead ends: 163549 [2019-08-05 10:14:44,459 INFO L226 Difference]: Without dead ends: 163465 [2019-08-05 10:14:44,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=548, Invalid=1092, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163465 states. [2019-08-05 10:14:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163465 to 132699. [2019-08-05 10:14:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132699 states. [2019-08-05 10:14:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132699 states to 132699 states and 174142 transitions. [2019-08-05 10:14:45,960 INFO L78 Accepts]: Start accepts. Automaton has 132699 states and 174142 transitions. Word has length 187 [2019-08-05 10:14:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:45,960 INFO L475 AbstractCegarLoop]: Abstraction has 132699 states and 174142 transitions. [2019-08-05 10:14:45,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:14:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 132699 states and 174142 transitions. [2019-08-05 10:14:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:14:45,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:45,966 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:45,966 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash 843420614, now seen corresponding path program 1 times [2019-08-05 10:14:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:45,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:14:45,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-08-05 10:14:46,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:46,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:14:46,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:14:46,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:14:46,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:46,072 INFO L87 Difference]: Start difference. First operand 132699 states and 174142 transitions. Second operand 3 states. [2019-08-05 10:14:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:46,412 INFO L93 Difference]: Finished difference Result 132741 states and 173902 transitions. [2019-08-05 10:14:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:14:46,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-08-05 10:14:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:46,562 INFO L225 Difference]: With dead ends: 132741 [2019-08-05 10:14:46,562 INFO L226 Difference]: Without dead ends: 132310 [2019-08-05 10:14:46,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 185 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:14:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132310 states. [2019-08-05 10:14:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132310 to 129865. [2019-08-05 10:14:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129865 states. [2019-08-05 10:14:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129865 states to 129865 states and 169219 transitions. [2019-08-05 10:14:49,864 INFO L78 Accepts]: Start accepts. Automaton has 129865 states and 169219 transitions. Word has length 188 [2019-08-05 10:14:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:49,864 INFO L475 AbstractCegarLoop]: Abstraction has 129865 states and 169219 transitions. [2019-08-05 10:14:49,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:14:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 129865 states and 169219 transitions. [2019-08-05 10:14:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:14:49,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:49,869 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:49,869 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash -342696274, now seen corresponding path program 1 times [2019-08-05 10:14:49,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:49,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:14:49,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:49,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,668 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-08-05 10:14:50,977 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:14:51,258 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 10:14:51,520 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:14:51,770 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:14:51,981 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-08-05 10:14:52,186 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-08-05 10:14:52,365 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:14:52,518 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:14:52,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:14:52,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,017 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 13 [2019-08-05 10:14:53,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 32 proven. 325 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 10:14:53,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:53,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:14:53,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:14:53,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:14:53,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:14:53,287 INFO L87 Difference]: Start difference. First operand 129865 states and 169219 transitions. Second operand 20 states. [2019-08-05 10:14:55,078 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:14:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:55,923 INFO L93 Difference]: Finished difference Result 130457 states and 169878 transitions. [2019-08-05 10:14:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:14:55,924 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 188 [2019-08-05 10:14:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:56,059 INFO L225 Difference]: With dead ends: 130457 [2019-08-05 10:14:56,059 INFO L226 Difference]: Without dead ends: 130457 [2019-08-05 10:14:56,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=268, Invalid=662, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:14:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130457 states. [2019-08-05 10:14:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130457 to 129813. [2019-08-05 10:14:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129813 states. [2019-08-05 10:14:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129813 states to 129813 states and 169168 transitions. [2019-08-05 10:14:57,697 INFO L78 Accepts]: Start accepts. Automaton has 129813 states and 169168 transitions. Word has length 188 [2019-08-05 10:14:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:57,697 INFO L475 AbstractCegarLoop]: Abstraction has 129813 states and 169168 transitions. [2019-08-05 10:14:57,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:14:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 129813 states and 169168 transitions. [2019-08-05 10:14:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:14:57,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:57,701 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:57,702 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:57,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1180149250, now seen corresponding path program 2 times [2019-08-05 10:14:57,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:57,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:14:57,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:57,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,917 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 36 proven. 341 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:14:58,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:58,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:14:58,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:14:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:14:58,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:14:58,705 INFO L87 Difference]: Start difference. First operand 129813 states and 169168 transitions. Second operand 20 states. [2019-08-05 10:15:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:05,901 INFO L93 Difference]: Finished difference Result 325050 states and 421295 transitions. [2019-08-05 10:15:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:15:05,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 188 [2019-08-05 10:15:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:06,268 INFO L225 Difference]: With dead ends: 325050 [2019-08-05 10:15:06,268 INFO L226 Difference]: Without dead ends: 325050 [2019-08-05 10:15:06,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:15:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325050 states. [2019-08-05 10:15:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325050 to 166063. [2019-08-05 10:15:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166063 states. [2019-08-05 10:15:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166063 states to 166063 states and 216772 transitions. [2019-08-05 10:15:08,231 INFO L78 Accepts]: Start accepts. Automaton has 166063 states and 216772 transitions. Word has length 188 [2019-08-05 10:15:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:08,232 INFO L475 AbstractCegarLoop]: Abstraction has 166063 states and 216772 transitions. [2019-08-05 10:15:08,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:15:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 166063 states and 216772 transitions. [2019-08-05 10:15:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:15:08,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:08,236 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:08,236 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:08,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:08,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1838011222, now seen corresponding path program 3 times [2019-08-05 10:15:08,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:08,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:15:08,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:08,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 31 proven. 347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:09,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:09,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:15:09,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:15:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:15:09,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:15:09,760 INFO L87 Difference]: Start difference. First operand 166063 states and 216772 transitions. Second operand 22 states. [2019-08-05 10:15:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:15,249 INFO L93 Difference]: Finished difference Result 414582 states and 536664 transitions. [2019-08-05 10:15:15,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:15:15,250 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 188 [2019-08-05 10:15:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:15,812 INFO L225 Difference]: With dead ends: 414582 [2019-08-05 10:15:15,812 INFO L226 Difference]: Without dead ends: 414582 [2019-08-05 10:15:15,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=997, Invalid=2785, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:15:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414582 states. [2019-08-05 10:15:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414582 to 176890. [2019-08-05 10:15:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176890 states. [2019-08-05 10:15:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176890 states to 176890 states and 230241 transitions. [2019-08-05 10:15:22,072 INFO L78 Accepts]: Start accepts. Automaton has 176890 states and 230241 transitions. Word has length 188 [2019-08-05 10:15:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,073 INFO L475 AbstractCegarLoop]: Abstraction has 176890 states and 230241 transitions. [2019-08-05 10:15:22,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:15:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 176890 states and 230241 transitions. [2019-08-05 10:15:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 10:15:22,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,077 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:22,077 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,078 INFO L82 PathProgramCache]: Analyzing trace with hash 257485284, now seen corresponding path program 2 times [2019-08-05 10:15:22,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:22,703 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-08-05 10:15:23,018 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-08-05 10:15:23,299 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-08-05 10:15:23,603 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:15:23,891 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-08-05 10:15:24,099 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-08-05 10:15:24,282 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:15:24,443 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:15:24,583 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:15:24,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:25,072 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 28 [2019-08-05 10:15:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:26,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:15:26,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:15:26,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:15:26,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:15:26,165 INFO L87 Difference]: Start difference. First operand 176890 states and 230241 transitions. Second operand 33 states. [2019-08-05 10:15:26,590 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-08-05 10:15:27,283 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-08-05 10:15:27,444 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-08-05 10:15:29,635 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-08-05 10:15:30,103 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-08-05 10:15:31,275 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-08-05 10:15:32,989 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-08-05 10:15:33,240 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-08-05 10:15:34,153 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-08-05 10:15:34,489 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-08-05 10:15:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:43,187 INFO L93 Difference]: Finished difference Result 499356 states and 641421 transitions. [2019-08-05 10:15:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:15:43,187 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 189 [2019-08-05 10:15:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:43,865 INFO L225 Difference]: With dead ends: 499356 [2019-08-05 10:15:43,865 INFO L226 Difference]: Without dead ends: 499356 [2019-08-05 10:15:43,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2280, Invalid=6840, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:15:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499356 states. [2019-08-05 10:15:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499356 to 271393. [2019-08-05 10:15:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271393 states. [2019-08-05 10:15:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271393 states to 271393 states and 353206 transitions. [2019-08-05 10:15:47,581 INFO L78 Accepts]: Start accepts. Automaton has 271393 states and 353206 transitions. Word has length 189 [2019-08-05 10:15:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:47,582 INFO L475 AbstractCegarLoop]: Abstraction has 271393 states and 353206 transitions. [2019-08-05 10:15:47,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:15:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 271393 states and 353206 transitions. [2019-08-05 10:15:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 10:15:47,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:47,585 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:47,585 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:47,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1072491423, now seen corresponding path program 1 times [2019-08-05 10:15:47,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:47,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:15:47,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:47,754 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:15:47,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:47,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 10:15:48,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:48,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:15:48,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:15:48,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:15:48,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:48,320 INFO L87 Difference]: Start difference. First operand 271393 states and 353206 transitions. Second operand 14 states. [2019-08-05 10:15:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:50,133 INFO L93 Difference]: Finished difference Result 272622 states and 354605 transitions. [2019-08-05 10:15:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:15:50,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2019-08-05 10:15:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:50,461 INFO L225 Difference]: With dead ends: 272622 [2019-08-05 10:15:50,461 INFO L226 Difference]: Without dead ends: 271633 [2019-08-05 10:15:50,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:15:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271633 states. [2019-08-05 10:15:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271633 to 271543. [2019-08-05 10:15:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271543 states. [2019-08-05 10:15:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271543 states to 271543 states and 353372 transitions. [2019-08-05 10:15:57,436 INFO L78 Accepts]: Start accepts. Automaton has 271543 states and 353372 transitions. Word has length 189 [2019-08-05 10:15:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:57,436 INFO L475 AbstractCegarLoop]: Abstraction has 271543 states and 353372 transitions. [2019-08-05 10:15:57,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:15:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 271543 states and 353372 transitions. [2019-08-05 10:15:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 10:15:57,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:57,440 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:57,441 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:57,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash 705985538, now seen corresponding path program 3 times [2019-08-05 10:15:57,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:57,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:15:57,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:57,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,659 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:57,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:58,252 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-08-05 10:15:58,557 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:15:58,837 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 10:15:59,108 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:15:59,365 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:15:59,671 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-08-05 10:15:59,892 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-08-05 10:16:00,079 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-08-05 10:16:00,247 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:16:00,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:00,473 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 28 [2019-08-05 10:16:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 52 proven. 316 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 10:16:00,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:16:00,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:16:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:16:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:16:00,932 INFO L87 Difference]: Start difference. First operand 271543 states and 353372 transitions. Second operand 29 states. [2019-08-05 10:16:01,144 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-08-05 10:16:01,782 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-08-05 10:16:03,468 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-08-05 10:16:03,833 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-08-05 10:16:05,058 WARN L188 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-08-05 10:16:05,317 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-08-05 10:16:06,358 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-08-05 10:16:07,185 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-08-05 10:16:08,722 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-08-05 10:16:09,984 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 11 [2019-08-05 10:16:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:11,587 INFO L93 Difference]: Finished difference Result 606522 states and 789221 transitions. [2019-08-05 10:16:11,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:16:11,587 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 189 [2019-08-05 10:16:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:12,430 INFO L225 Difference]: With dead ends: 606522 [2019-08-05 10:16:12,430 INFO L226 Difference]: Without dead ends: 606522 [2019-08-05 10:16:12,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1930, Invalid=4876, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:16:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606522 states. [2019-08-05 10:16:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606522 to 397695. [2019-08-05 10:16:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397695 states. [2019-08-05 10:16:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397695 states to 397695 states and 521943 transitions. [2019-08-05 10:16:24,287 INFO L78 Accepts]: Start accepts. Automaton has 397695 states and 521943 transitions. Word has length 189 [2019-08-05 10:16:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:24,287 INFO L475 AbstractCegarLoop]: Abstraction has 397695 states and 521943 transitions. [2019-08-05 10:16:24,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:16:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 397695 states and 521943 transitions. [2019-08-05 10:16:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-05 10:16:24,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:24,291 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:24,291 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash -187162151, now seen corresponding path program 4 times [2019-08-05 10:16:24,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:24,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:16:24,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:24,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:24,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:25,925 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 87 DAG size of output: 15 [2019-08-05 10:16:25,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:25,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:25,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:25,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:25,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:25,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:25,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:25,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:26,188 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 28 [2019-08-05 10:16:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 402 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:16:26,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:26,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:16:26,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:16:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:16:26,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:16:26,606 INFO L87 Difference]: Start difference. First operand 397695 states and 521943 transitions. Second operand 18 states. Received shutdown request... [2019-08-05 10:16:27,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:16:27,276 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:16:27,279 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:16:27,280 INFO L202 PluginConnector]: Adding new model u2b08_batman_intermittent_power_1slot_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:16:27 BoogieIcfgContainer [2019-08-05 10:16:27,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:16:27,281 INFO L168 Benchmark]: Toolchain (without parser) took 221763.57 ms. Allocated memory was 139.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 106.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-08-05 10:16:27,281 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:16:27,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.21 ms. Allocated memory is still 139.5 MB. Free memory was 106.1 MB in the beginning and 104.0 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:27,282 INFO L168 Benchmark]: Boogie Preprocessor took 97.64 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 100.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:27,283 INFO L168 Benchmark]: RCFGBuilder took 3640.64 ms. Allocated memory was 139.5 MB in the beginning and 178.8 MB in the end (delta: 39.3 MB). Free memory was 100.6 MB in the beginning and 53.9 MB in the end (delta: 46.8 MB). Peak memory consumption was 86.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:27,283 INFO L168 Benchmark]: TraceAbstraction took 217947.39 ms. Allocated memory was 178.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 53.9 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-08-05 10:16:27,286 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.24 ms. Allocated memory is still 139.5 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.21 ms. Allocated memory is still 139.5 MB. Free memory was 106.1 MB in the beginning and 104.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.64 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 100.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3640.64 ms. Allocated memory was 139.5 MB in the beginning and 178.8 MB in the end (delta: 39.3 MB). Free memory was 100.6 MB in the beginning and 53.9 MB in the end (delta: 46.8 MB). Peak memory consumption was 86.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217947.39 ms. Allocated memory was 178.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 53.9 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (397695states) and FLOYD_HOARE automaton (currently 9 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 413]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 413). Cancelled while BasicCegarLoop was constructing difference of abstraction (397695states) and FLOYD_HOARE automaton (currently 9 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 2 error locations. TIMEOUT Result, 217.8s OverallTime, 53 OverallIterations, 6 TraceHistogramMax, 101.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9856 SDtfs, 34191 SDslu, 46425 SDs, 0 SdLazy, 32891 SolverSat, 5139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7423 GetRequests, 6437 SyntacticMatches, 48 SemanticMatches, 937 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14800 ImplicationChecksByTransitivity, 78.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397695occurred in iteration=52, 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: 43.1s AutomataMinimizationTime, 52 MinimizatonAttempts, 947571 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 71.1s InterpolantComputationTime, 7026 NumberOfCodeBlocks, 7026 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 6973 ConstructedInterpolants, 0 QuantifiedInterpolants, 11827312 SizeOfPredicates, 373 NumberOfNonLiveVariables, 18304 ConjunctsInSsa, 964 ConjunctsInUnsatCore, 53 InterpolantComputations, 17 PerfectInterpolantSequences, 3633/11190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown