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/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_700.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:10:36,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:10:36,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:10:36,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:10:36,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:10:36,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:10:36,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:10:36,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:10:36,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:10:36,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:10:36,161 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:10:36,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:10:36,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:10:36,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:10:36,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:10:36,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:10:36,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:10:36,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:10:36,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:10:36,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:10:36,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:10:36,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:10:36,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:10:36,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:10:36,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:10:36,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:10:36,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:10:36,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:10:36,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:10:36,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:10:36,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:10:36,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:10:36,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:10:36,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:10:36,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:10:36,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:10:36,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:10:36,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:10:36,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:10:36,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:10:36,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:10:36,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:10:36,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:10:36,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:10:36,265 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:10:36,265 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:10:36,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_700.bpl [2019-08-05 10:10:36,266 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedautomataBSearch/u2b07_batman_intermittent_power_700.bpl' [2019-08-05 10:10:36,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:10:36,360 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:10:36,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:10:36,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:10:36,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:10:36,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,424 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:10:36,425 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:10:36,425 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:10:36,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:10:36,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:10:36,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:10:36,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:10:36,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/1) ... [2019-08-05 10:10:36,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:10:36,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:10:36,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:10:36,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:10:36,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (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:10:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:10:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:10:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:10:36,628 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_LZ_1$t0 [2019-08-05 10:10:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:10:36,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:10:36,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:10:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:10:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:10:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:10:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:10:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:10:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:10:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:10:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_RX_1$t0 [2019-08-05 10:10:36,877 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:10:41,004 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:10:41,004 INFO L283 CfgBuilder]: Removed 32 assume(true) statements. [2019-08-05 10:10:41,006 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:10:41 BoogieIcfgContainer [2019-08-05 10:10:41,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:10:41,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:10:41,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:10:41,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:10:41,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:10:36" (1/2) ... [2019-08-05 10:10:41,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b1a088 and model type u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:10:41, skipping insertion in model container [2019-08-05 10:10:41,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:10:41" (2/2) ... [2019-08-05 10:10:41,015 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b07_batman_intermittent_power_700.bpl [2019-08-05 10:10:41,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:10:41,033 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:10:41,050 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:10:41,078 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:10:41,079 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:10:41,080 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:10:41,080 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:10:41,080 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:10:41,080 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:10:41,080 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:10:41,081 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:10:41,081 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:10:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-08-05 10:10:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:10:41,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:41,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:10:41,113 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash 21207, now seen corresponding path program 1 times [2019-08-05 10:10:41,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:41,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:41,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:41,370 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:10:41,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:41,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:10:41,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:41,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:41,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:41,392 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-08-05 10:10:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:41,456 INFO L93 Difference]: Finished difference Result 79 states and 153 transitions. [2019-08-05 10:10:41,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:41,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:10:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:41,473 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:10:41,474 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:10:41,476 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:10:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:10:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:10:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:10:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 135 transitions. [2019-08-05 10:10:41,522 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 135 transitions. Word has length 2 [2019-08-05 10:10:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:41,523 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 135 transitions. [2019-08-05 10:10:41,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 135 transitions. [2019-08-05 10:10:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:10:41,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:41,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:41,525 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1256322736, now seen corresponding path program 1 times [2019-08-05 10:10:41,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:41,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:41,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:41,630 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:10:41,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:41,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:41,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:41,634 INFO L87 Difference]: Start difference. First operand 77 states and 135 transitions. Second operand 3 states. [2019-08-05 10:10:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:42,227 INFO L93 Difference]: Finished difference Result 142 states and 235 transitions. [2019-08-05 10:10:42,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:42,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:10:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:42,230 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:10:42,230 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:10:42,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:10:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:10:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-08-05 10:10:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:10:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2019-08-05 10:10:42,247 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 8 [2019-08-05 10:10:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:42,248 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2019-08-05 10:10:42,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2019-08-05 10:10:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:10:42,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:42,249 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] [2019-08-05 10:10:42,250 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash -858023310, now seen corresponding path program 1 times [2019-08-05 10:10:42,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:42,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:42,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:42,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:42,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:42,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:42,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:42,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:42,347 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand 3 states. [2019-08-05 10:10:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:42,402 INFO L93 Difference]: Finished difference Result 272 states and 458 transitions. [2019-08-05 10:10:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:42,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:10:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:42,412 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:10:42,412 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:10:42,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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:10:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:10:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2019-08-05 10:10:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:10:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 450 transitions. [2019-08-05 10:10:42,436 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 450 transitions. Word has length 20 [2019-08-05 10:10:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:42,436 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 450 transitions. [2019-08-05 10:10:42,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 450 transitions. [2019-08-05 10:10:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:10:42,438 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:42,438 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] [2019-08-05 10:10:42,438 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:42,439 INFO L82 PathProgramCache]: Analyzing trace with hash -777560288, now seen corresponding path program 1 times [2019-08-05 10:10:42,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:42,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:42,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:42,553 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:10:42,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:42,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:42,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:42,558 INFO L87 Difference]: Start difference. First operand 262 states and 450 transitions. Second operand 3 states. [2019-08-05 10:10:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:42,637 INFO L93 Difference]: Finished difference Result 518 states and 886 transitions. [2019-08-05 10:10:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:42,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:10:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:42,647 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:10:42,647 INFO L226 Difference]: Without dead ends: 518 [2019-08-05 10:10:42,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:10:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-05 10:10:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-08-05 10:10:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:10:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 882 transitions. [2019-08-05 10:10:42,682 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 882 transitions. Word has length 21 [2019-08-05 10:10:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:42,682 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 882 transitions. [2019-08-05 10:10:42,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 882 transitions. [2019-08-05 10:10:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:10:42,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:42,684 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] [2019-08-05 10:10:42,684 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:42,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1667072215, now seen corresponding path program 1 times [2019-08-05 10:10:42,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:42,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:42,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:42,765 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:10:42,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:42,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:42,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:42,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:42,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:42,767 INFO L87 Difference]: Start difference. First operand 512 states and 882 transitions. Second operand 3 states. [2019-08-05 10:10:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:42,961 INFO L93 Difference]: Finished difference Result 1006 states and 1666 transitions. [2019-08-05 10:10:42,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:42,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:10:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:42,969 INFO L225 Difference]: With dead ends: 1006 [2019-08-05 10:10:42,969 INFO L226 Difference]: Without dead ends: 982 [2019-08-05 10:10:42,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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:10:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-08-05 10:10:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 972. [2019-08-05 10:10:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-08-05 10:10:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1634 transitions. [2019-08-05 10:10:43,002 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1634 transitions. Word has length 22 [2019-08-05 10:10:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:43,002 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1634 transitions. [2019-08-05 10:10:43,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1634 transitions. [2019-08-05 10:10:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:10:43,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:43,003 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] [2019-08-05 10:10:43,004 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2110740859, now seen corresponding path program 1 times [2019-08-05 10:10:43,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:43,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:43,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:43,066 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:10:43,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:43,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:43,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:43,068 INFO L87 Difference]: Start difference. First operand 972 states and 1634 transitions. Second operand 3 states. [2019-08-05 10:10:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:43,374 INFO L93 Difference]: Finished difference Result 1798 states and 2850 transitions. [2019-08-05 10:10:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:43,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:10:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:43,397 INFO L225 Difference]: With dead ends: 1798 [2019-08-05 10:10:43,397 INFO L226 Difference]: Without dead ends: 1798 [2019-08-05 10:10:43,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:10:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-08-05 10:10:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1780. [2019-08-05 10:10:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-08-05 10:10:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2834 transitions. [2019-08-05 10:10:43,442 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2834 transitions. Word has length 27 [2019-08-05 10:10:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:43,442 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2834 transitions. [2019-08-05 10:10:43,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2834 transitions. [2019-08-05 10:10:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:10:43,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:43,444 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, 1, 1] [2019-08-05 10:10:43,445 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1946526065, now seen corresponding path program 1 times [2019-08-05 10:10:43,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:43,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:10:43,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:43,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:43,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:44,006 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:10:44,254 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:10:44,301 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:10:44,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:44,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:44,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:44,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:44,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:44,303 INFO L87 Difference]: Start difference. First operand 1780 states and 2834 transitions. Second operand 5 states. [2019-08-05 10:10:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:45,081 INFO L93 Difference]: Finished difference Result 1829 states and 2887 transitions. [2019-08-05 10:10:45,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:45,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:10:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:45,092 INFO L225 Difference]: With dead ends: 1829 [2019-08-05 10:10:45,092 INFO L226 Difference]: Without dead ends: 1829 [2019-08-05 10:10:45,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-08-05 10:10:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2019-08-05 10:10:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-08-05 10:10:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2887 transitions. [2019-08-05 10:10:45,132 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2887 transitions. Word has length 35 [2019-08-05 10:10:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:45,132 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2887 transitions. [2019-08-05 10:10:45,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2887 transitions. [2019-08-05 10:10:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:10:45,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:45,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:45,136 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1941441835, now seen corresponding path program 1 times [2019-08-05 10:10:45,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:45,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:45,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:45,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:45,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:45,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:45,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:45,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:45,241 INFO L87 Difference]: Start difference. First operand 1829 states and 2887 transitions. Second operand 3 states. [2019-08-05 10:10:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:45,632 INFO L93 Difference]: Finished difference Result 2663 states and 4063 transitions. [2019-08-05 10:10:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:45,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:10:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:45,648 INFO L225 Difference]: With dead ends: 2663 [2019-08-05 10:10:45,648 INFO L226 Difference]: Without dead ends: 2631 [2019-08-05 10:10:45,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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:10:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-08-05 10:10:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2629. [2019-08-05 10:10:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-08-05 10:10:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4031 transitions. [2019-08-05 10:10:45,729 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4031 transitions. Word has length 60 [2019-08-05 10:10:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:45,730 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4031 transitions. [2019-08-05 10:10:45,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4031 transitions. [2019-08-05 10:10:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:10:45,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:45,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:45,733 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:45,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1650973313, now seen corresponding path program 1 times [2019-08-05 10:10:45,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:45,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:45,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:45,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:45,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:45,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:45,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:45,817 INFO L87 Difference]: Start difference. First operand 2629 states and 4031 transitions. Second operand 3 states. [2019-08-05 10:10:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:45,989 INFO L93 Difference]: Finished difference Result 3895 states and 5791 transitions. [2019-08-05 10:10:45,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:45,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-08-05 10:10:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:46,007 INFO L225 Difference]: With dead ends: 3895 [2019-08-05 10:10:46,008 INFO L226 Difference]: Without dead ends: 3895 [2019-08-05 10:10:46,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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:10:46,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2019-08-05 10:10:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3893. [2019-08-05 10:10:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-08-05 10:10:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5791 transitions. [2019-08-05 10:10:46,084 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5791 transitions. Word has length 63 [2019-08-05 10:10:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:46,085 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 5791 transitions. [2019-08-05 10:10:46,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5791 transitions. [2019-08-05 10:10:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:10:46,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:46,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:46,087 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash 919830319, now seen corresponding path program 1 times [2019-08-05 10:10:46,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:46,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:46,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:10:46,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:46,181 INFO L87 Difference]: Start difference. First operand 3893 states and 5791 transitions. Second operand 3 states. [2019-08-05 10:10:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:46,560 INFO L93 Difference]: Finished difference Result 3819 states and 5559 transitions. [2019-08-05 10:10:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:46,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-08-05 10:10:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:46,574 INFO L225 Difference]: With dead ends: 3819 [2019-08-05 10:10:46,574 INFO L226 Difference]: Without dead ends: 3745 [2019-08-05 10:10:46,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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:10:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-08-05 10:10:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3721. [2019-08-05 10:10:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-08-05 10:10:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5461 transitions. [2019-08-05 10:10:46,635 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5461 transitions. Word has length 68 [2019-08-05 10:10:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:46,635 INFO L475 AbstractCegarLoop]: Abstraction has 3721 states and 5461 transitions. [2019-08-05 10:10:46,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5461 transitions. [2019-08-05 10:10:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:10:46,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:46,638 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:46,639 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:46,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:46,639 INFO L82 PathProgramCache]: Analyzing trace with hash 373368093, now seen corresponding path program 1 times [2019-08-05 10:10:46,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:46,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:10:46,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:46,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:46,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:10:46,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:46,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:46,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:46,962 INFO L87 Difference]: Start difference. First operand 3721 states and 5461 transitions. Second operand 5 states. [2019-08-05 10:10:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:47,666 INFO L93 Difference]: Finished difference Result 4653 states and 6755 transitions. [2019-08-05 10:10:47,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:47,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-08-05 10:10:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:47,691 INFO L225 Difference]: With dead ends: 4653 [2019-08-05 10:10:47,691 INFO L226 Difference]: Without dead ends: 4649 [2019-08-05 10:10:47,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-08-05 10:10:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4517. [2019-08-05 10:10:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-08-05 10:10:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6562 transitions. [2019-08-05 10:10:47,788 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6562 transitions. Word has length 70 [2019-08-05 10:10:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:47,789 INFO L475 AbstractCegarLoop]: Abstraction has 4517 states and 6562 transitions. [2019-08-05 10:10:47,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6562 transitions. [2019-08-05 10:10:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:10:47,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:47,790 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:47,791 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash -30411294, now seen corresponding path program 1 times [2019-08-05 10:10:47,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:47,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:10:47,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:47,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:47,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:48,452 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:10:49,142 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:10:49,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:49,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:50,177 WARN L188 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:10:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:50,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:50,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:10:50,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:10:50,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:10:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:10:50,199 INFO L87 Difference]: Start difference. First operand 4517 states and 6562 transitions. Second operand 6 states. [2019-08-05 10:10:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:50,593 INFO L93 Difference]: Finished difference Result 4755 states and 6848 transitions. [2019-08-05 10:10:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:10:50,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-08-05 10:10:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:50,624 INFO L225 Difference]: With dead ends: 4755 [2019-08-05 10:10:50,624 INFO L226 Difference]: Without dead ends: 4755 [2019-08-05 10:10:50,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:10:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-08-05 10:10:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4732. [2019-08-05 10:10:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-08-05 10:10:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6824 transitions. [2019-08-05 10:10:50,699 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6824 transitions. Word has length 70 [2019-08-05 10:10:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:50,700 INFO L475 AbstractCegarLoop]: Abstraction has 4732 states and 6824 transitions. [2019-08-05 10:10:50,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:10:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6824 transitions. [2019-08-05 10:10:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:10:50,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:50,701 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:50,701 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179452, now seen corresponding path program 1 times [2019-08-05 10:10:50,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:50,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:10:50,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:10:50,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:50,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:10:50,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:50,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:50,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:50,825 INFO L87 Difference]: Start difference. First operand 4732 states and 6824 transitions. Second operand 5 states. [2019-08-05 10:10:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:51,522 INFO L93 Difference]: Finished difference Result 4812 states and 6942 transitions. [2019-08-05 10:10:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:10:51,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-08-05 10:10:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:51,569 INFO L225 Difference]: With dead ends: 4812 [2019-08-05 10:10:51,569 INFO L226 Difference]: Without dead ends: 4800 [2019-08-05 10:10:51,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 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:10:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2019-08-05 10:10:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4665. [2019-08-05 10:10:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-08-05 10:10:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6738 transitions. [2019-08-05 10:10:51,627 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 6738 transitions. Word has length 71 [2019-08-05 10:10:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:51,628 INFO L475 AbstractCegarLoop]: Abstraction has 4665 states and 6738 transitions. [2019-08-05 10:10:51,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 6738 transitions. [2019-08-05 10:10:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:10:51,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:51,629 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, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:51,629 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:51,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2074252044, now seen corresponding path program 1 times [2019-08-05 10:10:51,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:51,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:10:51,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:51,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:51,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,071 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:10:52,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,291 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:10:52,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 10:10:52,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:52,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:10:52,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:10:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:10:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:10:52,450 INFO L87 Difference]: Start difference. First operand 4665 states and 6738 transitions. Second operand 7 states. [2019-08-05 10:10:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:52,797 INFO L93 Difference]: Finished difference Result 4905 states and 7026 transitions. [2019-08-05 10:10:52,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:10:52,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-08-05 10:10:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:52,806 INFO L225 Difference]: With dead ends: 4905 [2019-08-05 10:10:52,807 INFO L226 Difference]: Without dead ends: 4905 [2019-08-05 10:10:52,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:10:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-08-05 10:10:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4902. [2019-08-05 10:10:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4902 states. [2019-08-05 10:10:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7023 transitions. [2019-08-05 10:10:52,870 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7023 transitions. Word has length 105 [2019-08-05 10:10:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:52,871 INFO L475 AbstractCegarLoop]: Abstraction has 4902 states and 7023 transitions. [2019-08-05 10:10:52,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:10:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7023 transitions. [2019-08-05 10:10:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:10:52,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:52,872 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, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:52,872 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1809599206, now seen corresponding path program 1 times [2019-08-05 10:10:52,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:52,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:10:52,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:53,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:53,778 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:10:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:10:53,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:53,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:10:53,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:10:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:10:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:53,798 INFO L87 Difference]: Start difference. First operand 4902 states and 7023 transitions. Second operand 5 states. [2019-08-05 10:10:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:53,969 INFO L93 Difference]: Finished difference Result 5173 states and 7346 transitions. [2019-08-05 10:10:53,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:53,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-08-05 10:10:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:53,980 INFO L225 Difference]: With dead ends: 5173 [2019-08-05 10:10:53,980 INFO L226 Difference]: Without dead ends: 5173 [2019-08-05 10:10:53,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-08-05 10:10:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5155. [2019-08-05 10:10:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5155 states. [2019-08-05 10:10:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7328 transitions. [2019-08-05 10:10:54,048 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7328 transitions. Word has length 107 [2019-08-05 10:10:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:54,048 INFO L475 AbstractCegarLoop]: Abstraction has 5155 states and 7328 transitions. [2019-08-05 10:10:54,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:10:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7328 transitions. [2019-08-05 10:10:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:10:54,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:54,051 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:54,051 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1148551150, now seen corresponding path program 1 times [2019-08-05 10:10:54,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:54,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:10:54,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 126 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:10:54,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:10:54,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:10:54,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:10:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:10:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:10:54,183 INFO L87 Difference]: Start difference. First operand 5155 states and 7328 transitions. Second operand 4 states. [2019-08-05 10:10:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:54,686 INFO L93 Difference]: Finished difference Result 11604 states and 16347 transitions. [2019-08-05 10:10:54,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:10:54,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-08-05 10:10:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:54,709 INFO L225 Difference]: With dead ends: 11604 [2019-08-05 10:10:54,709 INFO L226 Difference]: Without dead ends: 11556 [2019-08-05 10:10:54,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:10:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2019-08-05 10:10:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 10967. [2019-08-05 10:10:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-08-05 10:10:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15524 transitions. [2019-08-05 10:10:54,907 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15524 transitions. Word has length 130 [2019-08-05 10:10:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:54,908 INFO L475 AbstractCegarLoop]: Abstraction has 10967 states and 15524 transitions. [2019-08-05 10:10:54,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:10:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15524 transitions. [2019-08-05 10:10:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:10:54,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:54,910 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-08-05 10:10:54,911 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:54,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:54,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2126953540, now seen corresponding path program 1 times [2019-08-05 10:10:54,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:54,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:54,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:10:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:55,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:55,025 INFO L87 Difference]: Start difference. First operand 10967 states and 15524 transitions. Second operand 3 states. [2019-08-05 10:10:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:55,545 INFO L93 Difference]: Finished difference Result 15551 states and 21862 transitions. [2019-08-05 10:10:55,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:55,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-08-05 10:10:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:55,574 INFO L225 Difference]: With dead ends: 15551 [2019-08-05 10:10:55,574 INFO L226 Difference]: Without dead ends: 15455 [2019-08-05 10:10:55,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 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:10:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15455 states. [2019-08-05 10:10:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15455 to 15373. [2019-08-05 10:10:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2019-08-05 10:10:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 21682 transitions. [2019-08-05 10:10:55,777 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 21682 transitions. Word has length 134 [2019-08-05 10:10:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:55,777 INFO L475 AbstractCegarLoop]: Abstraction has 15373 states and 21682 transitions. [2019-08-05 10:10:55,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 21682 transitions. [2019-08-05 10:10:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:10:55,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:55,780 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, 3, 3, 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:10:55,780 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash 887643078, now seen corresponding path program 1 times [2019-08-05 10:10:55,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:55,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:10:55,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-08-05 10:10:55,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:10:55,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:10:55,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:10:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:10:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:10:55,898 INFO L87 Difference]: Start difference. First operand 15373 states and 21682 transitions. Second operand 3 states. [2019-08-05 10:10:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:10:56,593 INFO L93 Difference]: Finished difference Result 20487 states and 28307 transitions. [2019-08-05 10:10:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:10:56,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-08-05 10:10:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:10:56,619 INFO L225 Difference]: With dead ends: 20487 [2019-08-05 10:10:56,619 INFO L226 Difference]: Without dead ends: 20487 [2019-08-05 10:10:56,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 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:10:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2019-08-05 10:10:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20051. [2019-08-05 10:10:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20051 states. [2019-08-05 10:10:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20051 states to 20051 states and 27873 transitions. [2019-08-05 10:10:56,856 INFO L78 Accepts]: Start accepts. Automaton has 20051 states and 27873 transitions. Word has length 138 [2019-08-05 10:10:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:10:56,857 INFO L475 AbstractCegarLoop]: Abstraction has 20051 states and 27873 transitions. [2019-08-05 10:10:56,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:10:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 20051 states and 27873 transitions. [2019-08-05 10:10:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:10:56,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:10:56,860 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, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:10:56,860 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:10:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:10:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash 11293620, now seen corresponding path program 1 times [2019-08-05 10:10:56,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:10:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:10:56,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:10:56,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:10:57,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,560 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 5 [2019-08-05 10:10:57,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,790 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 9 [2019-08-05 10:10:57,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:57,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:10:58,298 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:10:58,688 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:10:58,942 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:10:59,217 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:10:59,459 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:10:59,703 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:10:59,920 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:11:00,120 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:11:00,298 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:11:00,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:11:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:00,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:00,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:11:00,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:11:00,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:11:00,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:11:00,391 INFO L87 Difference]: Start difference. First operand 20051 states and 27873 transitions. Second operand 20 states. [2019-08-05 10:11:01,535 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-08-05 10:11:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:02,164 INFO L93 Difference]: Finished difference Result 21935 states and 30075 transitions. [2019-08-05 10:11:02,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:11:02,164 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2019-08-05 10:11:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:02,186 INFO L225 Difference]: With dead ends: 21935 [2019-08-05 10:11:02,186 INFO L226 Difference]: Without dead ends: 21935 [2019-08-05 10:11:02,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=306, Invalid=624, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:11:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21935 states. [2019-08-05 10:11:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21935 to 21838. [2019-08-05 10:11:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21838 states. [2019-08-05 10:11:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21838 states to 21838 states and 29978 transitions. [2019-08-05 10:11:02,447 INFO L78 Accepts]: Start accepts. Automaton has 21838 states and 29978 transitions. Word has length 139 [2019-08-05 10:11:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:02,448 INFO L475 AbstractCegarLoop]: Abstraction has 21838 states and 29978 transitions. [2019-08-05 10:11:02,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:11:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 21838 states and 29978 transitions. [2019-08-05 10:11:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:11:02,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:02,451 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, 3, 3, 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:11:02,451 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:02,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1823249627, now seen corresponding path program 1 times [2019-08-05 10:11:02,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:02,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:11:02,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:02,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:02,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:03,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:04,144 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:11:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:11:04,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:04,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:11:04,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:11:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:11:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:11:04,194 INFO L87 Difference]: Start difference. First operand 21838 states and 29978 transitions. Second operand 7 states. [2019-08-05 10:11:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:04,621 INFO L93 Difference]: Finished difference Result 23920 states and 32548 transitions. [2019-08-05 10:11:04,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:11:04,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-08-05 10:11:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:04,646 INFO L225 Difference]: With dead ends: 23920 [2019-08-05 10:11:04,646 INFO L226 Difference]: Without dead ends: 23920 [2019-08-05 10:11:04,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23920 states. [2019-08-05 10:11:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23920 to 23546. [2019-08-05 10:11:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23546 states. [2019-08-05 10:11:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23546 states to 23546 states and 32116 transitions. [2019-08-05 10:11:04,871 INFO L78 Accepts]: Start accepts. Automaton has 23546 states and 32116 transitions. Word has length 143 [2019-08-05 10:11:04,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:04,871 INFO L475 AbstractCegarLoop]: Abstraction has 23546 states and 32116 transitions. [2019-08-05 10:11:04,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:11:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 23546 states and 32116 transitions. [2019-08-05 10:11:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:11:04,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:04,873 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, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:04,874 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:04,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1330469809, now seen corresponding path program 1 times [2019-08-05 10:11:04,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:04,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:11:04,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 10:11:05,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:05,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:11:05,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:11:05,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:11:05,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:11:05,175 INFO L87 Difference]: Start difference. First operand 23546 states and 32116 transitions. Second operand 5 states. [2019-08-05 10:11:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:05,387 INFO L93 Difference]: Finished difference Result 24324 states and 33161 transitions. [2019-08-05 10:11:05,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:11:05,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-08-05 10:11:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:05,410 INFO L225 Difference]: With dead ends: 24324 [2019-08-05 10:11:05,410 INFO L226 Difference]: Without dead ends: 24317 [2019-08-05 10:11:05,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:11:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-08-05 10:11:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 24035. [2019-08-05 10:11:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-08-05 10:11:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 32686 transitions. [2019-08-05 10:11:05,760 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 32686 transitions. Word has length 143 [2019-08-05 10:11:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:05,761 INFO L475 AbstractCegarLoop]: Abstraction has 24035 states and 32686 transitions. [2019-08-05 10:11:05,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:11:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 32686 transitions. [2019-08-05 10:11:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:11:05,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:05,769 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, 4, 4, 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] [2019-08-05 10:11:05,770 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:05,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1674424068, now seen corresponding path program 1 times [2019-08-05 10:11:05,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:05,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:05,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 10:11:05,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:05,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:05,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:05,875 INFO L87 Difference]: Start difference. First operand 24035 states and 32686 transitions. Second operand 3 states. [2019-08-05 10:11:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:06,118 INFO L93 Difference]: Finished difference Result 28005 states and 37776 transitions. [2019-08-05 10:11:06,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:06,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-08-05 10:11:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:06,150 INFO L225 Difference]: With dead ends: 28005 [2019-08-05 10:11:06,150 INFO L226 Difference]: Without dead ends: 27932 [2019-08-05 10:11:06,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 168 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:11:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27932 states. [2019-08-05 10:11:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27932 to 27882. [2019-08-05 10:11:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27882 states. [2019-08-05 10:11:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27882 states to 27882 states and 37631 transitions. [2019-08-05 10:11:06,388 INFO L78 Accepts]: Start accepts. Automaton has 27882 states and 37631 transitions. Word has length 171 [2019-08-05 10:11:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:06,389 INFO L475 AbstractCegarLoop]: Abstraction has 27882 states and 37631 transitions. [2019-08-05 10:11:06,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 27882 states and 37631 transitions. [2019-08-05 10:11:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:11:06,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:06,393 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:06,393 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:06,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash -110644143, now seen corresponding path program 1 times [2019-08-05 10:11:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:06,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:06,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 10:11:06,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:06,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:06,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:06,525 INFO L87 Difference]: Start difference. First operand 27882 states and 37631 transitions. Second operand 3 states. [2019-08-05 10:11:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:07,053 INFO L93 Difference]: Finished difference Result 31872 states and 42931 transitions. [2019-08-05 10:11:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:07,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-08-05 10:11:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:07,084 INFO L225 Difference]: With dead ends: 31872 [2019-08-05 10:11:07,084 INFO L226 Difference]: Without dead ends: 31824 [2019-08-05 10:11:07,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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:11:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31824 states. [2019-08-05 10:11:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31824 to 29962. [2019-08-05 10:11:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29962 states. [2019-08-05 10:11:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29962 states to 29962 states and 40395 transitions. [2019-08-05 10:11:07,347 INFO L78 Accepts]: Start accepts. Automaton has 29962 states and 40395 transitions. Word has length 173 [2019-08-05 10:11:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:07,348 INFO L475 AbstractCegarLoop]: Abstraction has 29962 states and 40395 transitions. [2019-08-05 10:11:07,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29962 states and 40395 transitions. [2019-08-05 10:11:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:11:07,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:07,351 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, 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] [2019-08-05 10:11:07,352 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash 369991458, now seen corresponding path program 1 times [2019-08-05 10:11:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:07,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:11:07,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:07,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:07,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,132 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:11:09,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:09,514 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 5 [2019-08-05 10:11:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 10:11:09,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:09,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:11:09,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:11:09,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:11:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:09,579 INFO L87 Difference]: Start difference. First operand 29962 states and 40395 transitions. Second operand 8 states. [2019-08-05 10:11:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:10,036 INFO L93 Difference]: Finished difference Result 34159 states and 45568 transitions. [2019-08-05 10:11:10,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:11:10,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-08-05 10:11:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:10,069 INFO L225 Difference]: With dead ends: 34159 [2019-08-05 10:11:10,069 INFO L226 Difference]: Without dead ends: 34159 [2019-08-05 10:11:10,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:11:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34159 states. [2019-08-05 10:11:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34159 to 33905. [2019-08-05 10:11:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33905 states. [2019-08-05 10:11:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33905 states to 33905 states and 45314 transitions. [2019-08-05 10:11:10,480 INFO L78 Accepts]: Start accepts. Automaton has 33905 states and 45314 transitions. Word has length 174 [2019-08-05 10:11:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:10,480 INFO L475 AbstractCegarLoop]: Abstraction has 33905 states and 45314 transitions. [2019-08-05 10:11:10,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:11:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 33905 states and 45314 transitions. [2019-08-05 10:11:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 10:11:10,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:10,485 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, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:10,485 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:10,485 INFO L82 PathProgramCache]: Analyzing trace with hash 570429234, now seen corresponding path program 1 times [2019-08-05 10:11:10,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:10,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:11:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 194 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-08-05 10:11:10,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:10,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:11:10,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:11:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:11:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:10,923 INFO L87 Difference]: Start difference. First operand 33905 states and 45314 transitions. Second operand 8 states. [2019-08-05 10:11:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:11,463 INFO L93 Difference]: Finished difference Result 63378 states and 85380 transitions. [2019-08-05 10:11:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:11:11,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-08-05 10:11:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:11,524 INFO L225 Difference]: With dead ends: 63378 [2019-08-05 10:11:11,524 INFO L226 Difference]: Without dead ends: 63288 [2019-08-05 10:11:11,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:11:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63288 states. [2019-08-05 10:11:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63288 to 47156. [2019-08-05 10:11:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47156 states. [2019-08-05 10:11:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47156 states to 47156 states and 64161 transitions. [2019-08-05 10:11:12,782 INFO L78 Accepts]: Start accepts. Automaton has 47156 states and 64161 transitions. Word has length 175 [2019-08-05 10:11:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:12,782 INFO L475 AbstractCegarLoop]: Abstraction has 47156 states and 64161 transitions. [2019-08-05 10:11:12,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:11:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 47156 states and 64161 transitions. [2019-08-05 10:11:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:11:12,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:12,788 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:11:12,788 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash -758038053, now seen corresponding path program 1 times [2019-08-05 10:11:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:12,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:11:12,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:13,036 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:11:13,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,181 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 11 [2019-08-05 10:11:13,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:13,938 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:11:14,223 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:11:14,474 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:11:14,728 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:11:14,982 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:11:15,182 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:11:15,396 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:11:15,596 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:11:15,749 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:11:15,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:11:15,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:15,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:15,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:15,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 4 proven. 282 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:11:15,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:15,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:11:15,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:11:15,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:11:15,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:11:15,964 INFO L87 Difference]: Start difference. First operand 47156 states and 64161 transitions. Second operand 23 states. [2019-08-05 10:11:16,585 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 25 [2019-08-05 10:11:16,824 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 27 [2019-08-05 10:11:18,540 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:11:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:18,929 INFO L93 Difference]: Finished difference Result 58363 states and 78277 transitions. [2019-08-05 10:11:18,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:11:18,930 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 177 [2019-08-05 10:11:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:18,991 INFO L225 Difference]: With dead ends: 58363 [2019-08-05 10:11:18,991 INFO L226 Difference]: Without dead ends: 58363 [2019-08-05 10:11:18,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:11:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58363 states. [2019-08-05 10:11:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58363 to 54535. [2019-08-05 10:11:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54535 states. [2019-08-05 10:11:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54535 states to 54535 states and 73601 transitions. [2019-08-05 10:11:19,497 INFO L78 Accepts]: Start accepts. Automaton has 54535 states and 73601 transitions. Word has length 177 [2019-08-05 10:11:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:19,498 INFO L475 AbstractCegarLoop]: Abstraction has 54535 states and 73601 transitions. [2019-08-05 10:11:19,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:11:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 54535 states and 73601 transitions. [2019-08-05 10:11:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-05 10:11:19,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:19,504 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, 5, 5, 4, 4, 4, 4, 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] [2019-08-05 10:11:19,504 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1753462791, now seen corresponding path program 1 times [2019-08-05 10:11:19,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:19,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:11:19,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:19,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:19,976 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:11:20,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:20,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,258 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 82 DAG size of output: 5 [2019-08-05 10:11:21,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:21,532 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:11:21,900 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:11:22,174 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:11:22,433 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:11:22,666 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:11:22,897 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:11:23,143 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:11:23,354 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:11:23,529 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:11:23,672 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:11:23,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:23,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:23,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:23,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:23,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:23,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:23,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:23,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:11:23,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:11:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:11:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:11:23,849 INFO L87 Difference]: Start difference. First operand 54535 states and 73601 transitions. Second operand 22 states. [2019-08-05 10:11:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:26,210 INFO L93 Difference]: Finished difference Result 57305 states and 76887 transitions. [2019-08-05 10:11:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:11:26,211 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2019-08-05 10:11:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:26,267 INFO L225 Difference]: With dead ends: 57305 [2019-08-05 10:11:26,268 INFO L226 Difference]: Without dead ends: 57305 [2019-08-05 10:11:26,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:11:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57305 states. [2019-08-05 10:11:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57305 to 55550. [2019-08-05 10:11:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55550 states. [2019-08-05 10:11:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55550 states to 55550 states and 74818 transitions. [2019-08-05 10:11:26,845 INFO L78 Accepts]: Start accepts. Automaton has 55550 states and 74818 transitions. Word has length 178 [2019-08-05 10:11:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:26,845 INFO L475 AbstractCegarLoop]: Abstraction has 55550 states and 74818 transitions. [2019-08-05 10:11:26,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:11:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 55550 states and 74818 transitions. [2019-08-05 10:11:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 10:11:26,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:26,852 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 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] [2019-08-05 10:11:26,852 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:26,853 INFO L82 PathProgramCache]: Analyzing trace with hash -275131603, now seen corresponding path program 1 times [2019-08-05 10:11:26,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:26,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:26,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 10:11:26,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:26,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:26,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:26,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:26,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:26,972 INFO L87 Difference]: Start difference. First operand 55550 states and 74818 transitions. Second operand 3 states. [2019-08-05 10:11:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:27,881 INFO L93 Difference]: Finished difference Result 54534 states and 70764 transitions. [2019-08-05 10:11:27,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:27,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-08-05 10:11:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:27,973 INFO L225 Difference]: With dead ends: 54534 [2019-08-05 10:11:27,973 INFO L226 Difference]: Without dead ends: 54414 [2019-08-05 10:11:27,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 191 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:11:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54414 states. [2019-08-05 10:11:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54414 to 47565. [2019-08-05 10:11:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47565 states. [2019-08-05 10:11:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47565 states to 47565 states and 62175 transitions. [2019-08-05 10:11:28,634 INFO L78 Accepts]: Start accepts. Automaton has 47565 states and 62175 transitions. Word has length 194 [2019-08-05 10:11:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:28,634 INFO L475 AbstractCegarLoop]: Abstraction has 47565 states and 62175 transitions. [2019-08-05 10:11:28,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47565 states and 62175 transitions. [2019-08-05 10:11:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:11:28,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:28,643 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, 5, 5, 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] [2019-08-05 10:11:28,643 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:28,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:28,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1621474027, now seen corresponding path program 1 times [2019-08-05 10:11:28,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:28,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:11:28,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 142 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-08-05 10:11:28,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:28,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:11:28,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:11:28,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:11:28,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:11:28,832 INFO L87 Difference]: Start difference. First operand 47565 states and 62175 transitions. Second operand 6 states. [2019-08-05 10:11:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:29,531 INFO L93 Difference]: Finished difference Result 66827 states and 88079 transitions. [2019-08-05 10:11:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:11:29,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-08-05 10:11:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:29,607 INFO L225 Difference]: With dead ends: 66827 [2019-08-05 10:11:29,607 INFO L226 Difference]: Without dead ends: 66827 [2019-08-05 10:11:29,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 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:11:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66827 states. [2019-08-05 10:11:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66827 to 44927. [2019-08-05 10:11:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44927 states. [2019-08-05 10:11:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44927 states to 44927 states and 59012 transitions. [2019-08-05 10:11:30,128 INFO L78 Accepts]: Start accepts. Automaton has 44927 states and 59012 transitions. Word has length 195 [2019-08-05 10:11:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:30,129 INFO L475 AbstractCegarLoop]: Abstraction has 44927 states and 59012 transitions. [2019-08-05 10:11:30,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:11:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 44927 states and 59012 transitions. [2019-08-05 10:11:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:11:30,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:30,136 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 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] [2019-08-05 10:11:30,137 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1319648849, now seen corresponding path program 1 times [2019-08-05 10:11:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:30,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:11:30,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 210 proven. 128 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 10:11:30,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:30,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:11:30,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:11:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:11:30,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:11:30,575 INFO L87 Difference]: Start difference. First operand 44927 states and 59012 transitions. Second operand 8 states. [2019-08-05 10:11:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:31,173 INFO L93 Difference]: Finished difference Result 75763 states and 98574 transitions. [2019-08-05 10:11:31,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:11:31,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-08-05 10:11:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:31,260 INFO L225 Difference]: With dead ends: 75763 [2019-08-05 10:11:31,260 INFO L226 Difference]: Without dead ends: 75625 [2019-08-05 10:11:31,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:11:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75625 states. [2019-08-05 10:11:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75625 to 68588. [2019-08-05 10:11:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68588 states. [2019-08-05 10:11:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68588 states to 68588 states and 89202 transitions. [2019-08-05 10:11:32,217 INFO L78 Accepts]: Start accepts. Automaton has 68588 states and 89202 transitions. Word has length 196 [2019-08-05 10:11:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:32,218 INFO L475 AbstractCegarLoop]: Abstraction has 68588 states and 89202 transitions. [2019-08-05 10:11:32,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:11:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 68588 states and 89202 transitions. [2019-08-05 10:11:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:11:32,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:32,224 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1] [2019-08-05 10:11:32,224 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:32,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:32,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2127775696, now seen corresponding path program 1 times [2019-08-05 10:11:32,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:32,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:11:32,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-08-05 10:11:32,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:11:32,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:11:32,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:11:32,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:11:32,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:11:32,346 INFO L87 Difference]: Start difference. First operand 68588 states and 89202 transitions. Second operand 3 states. [2019-08-05 10:11:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:32,605 INFO L93 Difference]: Finished difference Result 88546 states and 114684 transitions. [2019-08-05 10:11:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:11:32,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-08-05 10:11:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:32,718 INFO L225 Difference]: With dead ends: 88546 [2019-08-05 10:11:32,718 INFO L226 Difference]: Without dead ends: 87546 [2019-08-05 10:11:32,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 197 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:11:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87546 states. [2019-08-05 10:11:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87546 to 87544. [2019-08-05 10:11:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87544 states. [2019-08-05 10:11:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87544 states to 87544 states and 113300 transitions. [2019-08-05 10:11:33,556 INFO L78 Accepts]: Start accepts. Automaton has 87544 states and 113300 transitions. Word has length 200 [2019-08-05 10:11:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:11:33,557 INFO L475 AbstractCegarLoop]: Abstraction has 87544 states and 113300 transitions. [2019-08-05 10:11:33,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:11:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 87544 states and 113300 transitions. [2019-08-05 10:11:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:11:33,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:11:33,562 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, 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, 1, 1, 1] [2019-08-05 10:11:33,562 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:11:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:11:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash -67160481, now seen corresponding path program 1 times [2019-08-05 10:11:33,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:11:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:11:33,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:11:33,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:11:33,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:33,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:35,534 WARN L188 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 35 DAG size of output: 1 [2019-08-05 10:11:35,948 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:11:36,268 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:11:36,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:36,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:37,003 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:11:37,266 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:11:37,522 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:11:37,757 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:11:37,969 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:11:38,171 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 10:11:38,414 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:11:38,754 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:11:38,904 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:11:38,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:11:38,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:38,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:38,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:38,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:11:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 20 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:11:39,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:11:39,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:11:39,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:11:39,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:11:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=652, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:11:39,448 INFO L87 Difference]: Start difference. First operand 87544 states and 113300 transitions. Second operand 30 states. [2019-08-05 10:11:40,735 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-08-05 10:11:43,785 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:11:44,932 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:11:45,271 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:11:45,439 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:11:47,153 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-08-05 10:11:47,887 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-05 10:11:48,145 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-08-05 10:11:48,341 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-08-05 10:11:48,530 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:11:48,876 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:11:49,270 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-08-05 10:11:49,727 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:11:49,903 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-08-05 10:11:52,423 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:11:52,695 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-08-05 10:11:53,090 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:11:53,410 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-08-05 10:11:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:11:55,203 INFO L93 Difference]: Finished difference Result 560683 states and 758394 transitions. [2019-08-05 10:11:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:11:55,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 203 [2019-08-05 10:11:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:11:56,118 INFO L225 Difference]: With dead ends: 560683 [2019-08-05 10:11:56,119 INFO L226 Difference]: Without dead ends: 556251 [2019-08-05 10:11:56,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4018 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2667, Invalid=7839, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:11:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556251 states. [2019-08-05 10:12:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556251 to 413384. [2019-08-05 10:12:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413384 states. [2019-08-05 10:12:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413384 states to 413384 states and 572682 transitions. [2019-08-05 10:12:05,455 INFO L78 Accepts]: Start accepts. Automaton has 413384 states and 572682 transitions. Word has length 203 [2019-08-05 10:12:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:05,455 INFO L475 AbstractCegarLoop]: Abstraction has 413384 states and 572682 transitions. [2019-08-05 10:12:05,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:12:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 413384 states and 572682 transitions. [2019-08-05 10:12:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:12:05,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:05,459 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2019-08-05 10:12:05,459 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1638698119, now seen corresponding path program 1 times [2019-08-05 10:12:05,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:05,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:12:05,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:05,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:05,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,339 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 11 [2019-08-05 10:12:06,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 31 proven. 378 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 10:12:06,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:06,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:12:06,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:12:06,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:12:06,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:12:06,720 INFO L87 Difference]: Start difference. First operand 413384 states and 572682 transitions. Second operand 16 states. [2019-08-05 10:12:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:14,110 INFO L93 Difference]: Finished difference Result 414860 states and 574279 transitions. [2019-08-05 10:12:14,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:12:14,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 204 [2019-08-05 10:12:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:14,793 INFO L225 Difference]: With dead ends: 414860 [2019-08-05 10:12:14,793 INFO L226 Difference]: Without dead ends: 414860 [2019-08-05 10:12:14,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:12:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414860 states. [2019-08-05 10:12:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414860 to 413581. [2019-08-05 10:12:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413581 states. [2019-08-05 10:12:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413581 states to 413581 states and 572902 transitions. [2019-08-05 10:12:25,459 INFO L78 Accepts]: Start accepts. Automaton has 413581 states and 572902 transitions. Word has length 204 [2019-08-05 10:12:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:25,460 INFO L475 AbstractCegarLoop]: Abstraction has 413581 states and 572902 transitions. [2019-08-05 10:12:25,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:12:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 413581 states and 572902 transitions. [2019-08-05 10:12:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:12:25,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:25,465 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 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:12:25,465 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash -733642234, now seen corresponding path program 1 times [2019-08-05 10:12:25,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:25,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:12:25,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:25,673 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:12:25,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:25,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:26,222 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-08-05 10:12:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 314 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 10:12:26,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:26,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:12:26,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:12:26,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:12:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:12:26,895 INFO L87 Difference]: Start difference. First operand 413581 states and 572902 transitions. Second operand 19 states. [2019-08-05 10:12:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:37,433 INFO L93 Difference]: Finished difference Result 715237 states and 971408 transitions. [2019-08-05 10:12:37,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:12:37,433 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 204 [2019-08-05 10:12:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:38,659 INFO L225 Difference]: With dead ends: 715237 [2019-08-05 10:12:38,659 INFO L226 Difference]: Without dead ends: 709845 [2019-08-05 10:12:38,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:12:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709845 states. [2019-08-05 10:12:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709845 to 617880. [2019-08-05 10:12:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617880 states. [2019-08-05 10:12:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617880 states to 617880 states and 851738 transitions. [2019-08-05 10:12:54,550 INFO L78 Accepts]: Start accepts. Automaton has 617880 states and 851738 transitions. Word has length 204 [2019-08-05 10:12:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:54,550 INFO L475 AbstractCegarLoop]: Abstraction has 617880 states and 851738 transitions. [2019-08-05 10:12:54,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:12:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 617880 states and 851738 transitions. [2019-08-05 10:12:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:12:54,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:54,557 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, 4, 4, 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] [2019-08-05 10:12:54,557 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:54,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash -402574455, now seen corresponding path program 1 times [2019-08-05 10:12:54,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:54,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:54,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-08-05 10:12:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:54,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:54,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:54,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:54,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:54,657 INFO L87 Difference]: Start difference. First operand 617880 states and 851738 transitions. Second operand 3 states. [2019-08-05 10:12:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:55,911 INFO L93 Difference]: Finished difference Result 614256 states and 831608 transitions. [2019-08-05 10:12:55,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:55,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-08-05 10:12:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:56,783 INFO L225 Difference]: With dead ends: 614256 [2019-08-05 10:12:56,784 INFO L226 Difference]: Without dead ends: 600340 [2019-08-05 10:12:56,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 203 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:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600340 states. [2019-08-05 10:13:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600340 to 576854. [2019-08-05 10:13:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576854 states. [2019-08-05 10:13:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576854 states to 576854 states and 782792 transitions. [2019-08-05 10:13:13,328 INFO L78 Accepts]: Start accepts. Automaton has 576854 states and 782792 transitions. Word has length 206 [2019-08-05 10:13:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:13,328 INFO L475 AbstractCegarLoop]: Abstraction has 576854 states and 782792 transitions. [2019-08-05 10:13:13,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 576854 states and 782792 transitions. [2019-08-05 10:13:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:13:13,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:13,331 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 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] [2019-08-05 10:13:13,331 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:13,332 INFO L82 PathProgramCache]: Analyzing trace with hash -947645514, now seen corresponding path program 1 times [2019-08-05 10:13:13,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:13,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:13:13,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 191 proven. 149 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-08-05 10:13:13,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:13,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:13,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:13,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:13,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:13,547 INFO L87 Difference]: Start difference. First operand 576854 states and 782792 transitions. Second operand 6 states. [2019-08-05 10:13:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:21,822 INFO L93 Difference]: Finished difference Result 573497 states and 778805 transitions. [2019-08-05 10:13:21,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:21,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2019-08-05 10:13:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:22,739 INFO L225 Difference]: With dead ends: 573497 [2019-08-05 10:13:22,739 INFO L226 Difference]: Without dead ends: 573137 [2019-08-05 10:13:22,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573137 states. [2019-08-05 10:13:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573137 to 573110. [2019-08-05 10:13:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573110 states. [2019-08-05 10:13:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573110 states to 573110 states and 778415 transitions. [2019-08-05 10:13:35,178 INFO L78 Accepts]: Start accepts. Automaton has 573110 states and 778415 transitions. Word has length 208 [2019-08-05 10:13:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:35,178 INFO L475 AbstractCegarLoop]: Abstraction has 573110 states and 778415 transitions. [2019-08-05 10:13:35,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 573110 states and 778415 transitions. [2019-08-05 10:13:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 10:13:35,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:35,183 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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:35,183 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:35,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:35,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1925586360, now seen corresponding path program 1 times [2019-08-05 10:13:35,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:35,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:13:35,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:35,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,368 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:35,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,196 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-08-05 10:13:36,481 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:13:36,729 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:13:36,961 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-08-05 10:13:37,181 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-08-05 10:13:37,376 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-08-05 10:13:37,544 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-08-05 10:13:37,695 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-08-05 10:13:37,845 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-08-05 10:13:37,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:37,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 34 proven. 448 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:38,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:38,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:13:38,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:13:38,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:13:38,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:13:38,210 INFO L87 Difference]: Start difference. First operand 573110 states and 778415 transitions. Second operand 23 states. [2019-08-05 10:13:38,668 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2019-08-05 10:13:39,069 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:13:40,434 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:13:41,272 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-08-05 10:13:41,520 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-08-05 10:13:46,659 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-08-05 10:13:46,985 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-08-05 10:13:49,404 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 Received shutdown request... [2019-08-05 10:13:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:13:52,977 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:13:52,983 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:13:52,984 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_700.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:13:52 BoogieIcfgContainer [2019-08-05 10:13:52,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:13:52,986 INFO L168 Benchmark]: Toolchain (without parser) took 196626.74 ms. Allocated memory was 134.2 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 106.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-08-05 10:13:52,987 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 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:13:52,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.90 ms. Allocated memory is still 134.2 MB. Free memory was 106.9 MB in the beginning and 104.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:52,989 INFO L168 Benchmark]: Boogie Preprocessor took 124.68 ms. Allocated memory is still 134.2 MB. Free memory was 104.6 MB in the beginning and 101.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:52,989 INFO L168 Benchmark]: RCFGBuilder took 4453.28 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 100.9 MB in the beginning and 134.2 MB in the end (delta: -33.3 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:52,990 INFO L168 Benchmark]: TraceAbstraction took 191976.42 ms. Allocated memory was 197.1 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 134.2 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-08-05 10:13:52,993 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.15 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 111.5 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 66.90 ms. Allocated memory is still 134.2 MB. Free memory was 106.9 MB in the beginning and 104.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.68 ms. Allocated memory is still 134.2 MB. Free memory was 104.6 MB in the beginning and 101.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4453.28 ms. Allocated memory was 134.2 MB in the beginning and 197.1 MB in the end (delta: 62.9 MB). Free memory was 100.9 MB in the beginning and 134.2 MB in the end (delta: -33.3 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191976.42 ms. Allocated memory was 197.1 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 134.2 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 469]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 469). Cancelled while BasicCegarLoop was constructing difference of abstraction (573110states) and FLOYD_HOARE automaton (currently 41 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (398259 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 706). Cancelled while BasicCegarLoop was constructing difference of abstraction (573110states) and FLOYD_HOARE automaton (currently 41 states, 23 states before enhancement),while ReachableStatesComputation was computing reachable states (398259 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. TIMEOUT Result, 191.9s OverallTime, 37 OverallIterations, 6 TraceHistogramMax, 82.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7070 SDtfs, 18543 SDslu, 26372 SDs, 0 SdLazy, 13083 SolverSat, 2069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4815 GetRequests, 4371 SyntacticMatches, 32 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6187 ImplicationChecksByTransitivity, 38.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=617880occurred in iteration=34, 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: 73.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 321537 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 4651 NumberOfCodeBlocks, 4651 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 4614 ConstructedInterpolants, 0 QuantifiedInterpolants, 4886368 SizeOfPredicates, 168 NumberOfNonLiveVariables, 13279 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 37 InterpolantComputations, 19 PerfectInterpolantSequences, 4241/7526 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown