java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b07_batman_intermittent_power_SAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:12:53,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:12:53,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:12:53,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:12:53,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:12:53,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:12:53,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:12:53,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:12:53,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:12:53,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:12:53,328 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:12:53,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:12:53,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:12:53,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:12:53,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:12:53,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:12:53,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:12:53,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:12:53,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:12:53,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:12:53,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:12:53,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:12:53,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:12:53,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:12:53,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:12:53,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:12:53,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:12:53,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:12:53,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:12:53,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:12:53,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:12:53,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:12:53,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:12:53,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:12:53,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:12:53,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:12:53,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:12:53,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:12:53,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:12:53,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:12:53,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:12:53,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:12:53,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:12:53,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:12:53,400 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:12:53,400 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:12:53,401 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b07_batman_intermittent_power_SAFE.bpl [2019-08-05 10:12:53,402 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b07_batman_intermittent_power_SAFE.bpl' [2019-08-05 10:12:53,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:12:53,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:12:53,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:53,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:12:53,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:12:53,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,588 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:12:53,589 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:12:53,589 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:12:53,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:53,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:12:53,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:12:53,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:12:53,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... [2019-08-05 10:12:53,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:12:53,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:12:53,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:12:53,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:12:53,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:12:53,778 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:12:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_time [2019-08-05 10:12:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_channelBusy [2019-08-05 10:12:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_LZ_1$t0 [2019-08-05 10:12:53,779 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t [2019-08-05 10:12:53,780 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:12:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:12:53,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:12:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_queue [2019-08-05 10:12:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t0 [2019-08-05 10:12:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MAC_1$t [2019-08-05 10:12:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_ENV_1$t0 [2019-08-05 10:12:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$sendCount [2019-08-05 10:12:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_MEDIUM_1$t0 [2019-08-05 10:12:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_APP_RX_1$t0 [2019-08-05 10:12:54,110 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:12:57,711 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:12:57,711 INFO L283 CfgBuilder]: Removed 32 assume(true) statements. [2019-08-05 10:12:57,712 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:57 BoogieIcfgContainer [2019-08-05 10:12:57,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:12:57,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:12:57,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:12:57,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:12:57,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:53" (1/2) ... [2019-08-05 10:12:57,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d812df8 and model type u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:12:57, skipping insertion in model container [2019-08-05 10:12:57,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:57" (2/2) ... [2019-08-05 10:12:57,721 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b07_batman_intermittent_power_SAFE.bpl [2019-08-05 10:12:57,729 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:12:57,735 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:12:57,747 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:12:57,774 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:12:57,775 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:12:57,775 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:12:57,775 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:12:57,775 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:12:57,775 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:12:57,776 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:12:57,776 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:12:57,776 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:12:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-08-05 10:12:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:12:57,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:57,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:12:57,804 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:57,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 21207, now seen corresponding path program 1 times [2019-08-05 10:12:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:57,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:57,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:58,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:58,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:12:58,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:58,049 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-08-05 10:12:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:58,160 INFO L93 Difference]: Finished difference Result 79 states and 153 transitions. [2019-08-05 10:12:58,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:58,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:12:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:58,185 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:12:58,185 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:12:58,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:12:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:12:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:12:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 135 transitions. [2019-08-05 10:12:58,237 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 135 transitions. Word has length 2 [2019-08-05 10:12:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:58,237 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 135 transitions. [2019-08-05 10:12:58,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 135 transitions. [2019-08-05 10:12:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:12:58,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:58,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:58,238 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1256322736, now seen corresponding path program 1 times [2019-08-05 10:12:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:58,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:58,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:58,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:58,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:58,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:58,381 INFO L87 Difference]: Start difference. First operand 77 states and 135 transitions. Second operand 3 states. [2019-08-05 10:12:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:58,993 INFO L93 Difference]: Finished difference Result 142 states and 235 transitions. [2019-08-05 10:12:58,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:58,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:12:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:58,995 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:12:58,996 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:12:58,997 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:12:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:12:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-08-05 10:12:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:12:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2019-08-05 10:12:59,019 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 8 [2019-08-05 10:12:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:59,019 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2019-08-05 10:12:59,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2019-08-05 10:12:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:12:59,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:59,020 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:12:59,021 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:59,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:59,021 INFO L82 PathProgramCache]: Analyzing trace with hash -858023310, now seen corresponding path program 1 times [2019-08-05 10:12:59,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:59,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:59,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:59,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:59,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:59,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:59,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:59,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:59,104 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand 3 states. [2019-08-05 10:12:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:59,167 INFO L93 Difference]: Finished difference Result 272 states and 458 transitions. [2019-08-05 10:12:59,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:59,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:12:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:59,173 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:12:59,173 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:12:59,175 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:12:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:12:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2019-08-05 10:12:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:12:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 450 transitions. [2019-08-05 10:12:59,205 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 450 transitions. Word has length 20 [2019-08-05 10:12:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:59,205 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 450 transitions. [2019-08-05 10:12:59,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 450 transitions. [2019-08-05 10:12:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:12:59,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:59,211 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:12:59,211 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash -777560288, now seen corresponding path program 1 times [2019-08-05 10:12:59,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:59,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:59,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:59,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:59,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:59,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:59,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:59,287 INFO L87 Difference]: Start difference. First operand 262 states and 450 transitions. Second operand 3 states. [2019-08-05 10:12:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:59,339 INFO L93 Difference]: Finished difference Result 518 states and 886 transitions. [2019-08-05 10:12:59,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:59,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:12:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:59,348 INFO L225 Difference]: With dead ends: 518 [2019-08-05 10:12:59,348 INFO L226 Difference]: Without dead ends: 518 [2019-08-05 10:12:59,349 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:12:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-05 10:12:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-08-05 10:12:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-05 10:12:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 882 transitions. [2019-08-05 10:12:59,391 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 882 transitions. Word has length 21 [2019-08-05 10:12:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:59,391 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 882 transitions. [2019-08-05 10:12:59,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 882 transitions. [2019-08-05 10:12:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:12:59,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:59,393 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:12:59,393 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:59,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1667072215, now seen corresponding path program 1 times [2019-08-05 10:12:59,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:59,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:59,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:59,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:59,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:59,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:59,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:59,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:59,485 INFO L87 Difference]: Start difference. First operand 512 states and 882 transitions. Second operand 3 states. [2019-08-05 10:12:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:59,641 INFO L93 Difference]: Finished difference Result 1006 states and 1666 transitions. [2019-08-05 10:12:59,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:59,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:12:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:59,650 INFO L225 Difference]: With dead ends: 1006 [2019-08-05 10:12:59,650 INFO L226 Difference]: Without dead ends: 982 [2019-08-05 10:12:59,651 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:12:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-08-05 10:12:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 972. [2019-08-05 10:12:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-08-05 10:12:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1634 transitions. [2019-08-05 10:12:59,676 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1634 transitions. Word has length 22 [2019-08-05 10:12:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:59,676 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1634 transitions. [2019-08-05 10:12:59,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1634 transitions. [2019-08-05 10:12:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:12:59,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:59,678 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:12:59,678 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:59,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:59,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2110740859, now seen corresponding path program 1 times [2019-08-05 10:12:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:59,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:59,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:59,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:59,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:59,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:59,735 INFO L87 Difference]: Start difference. First operand 972 states and 1634 transitions. Second operand 3 states. [2019-08-05 10:13:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:00,024 INFO L93 Difference]: Finished difference Result 1798 states and 2850 transitions. [2019-08-05 10:13:00,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:00,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:13:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:00,038 INFO L225 Difference]: With dead ends: 1798 [2019-08-05 10:13:00,038 INFO L226 Difference]: Without dead ends: 1798 [2019-08-05 10:13:00,038 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:13:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-08-05 10:13:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1780. [2019-08-05 10:13:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-08-05 10:13:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2834 transitions. [2019-08-05 10:13:00,082 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2834 transitions. Word has length 27 [2019-08-05 10:13:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:00,082 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2834 transitions. [2019-08-05 10:13:00,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2834 transitions. [2019-08-05 10:13:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:13:00,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:00,084 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:13:00,084 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:00,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1946526065, now seen corresponding path program 1 times [2019-08-05 10:13:00,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:00,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:00,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:00,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:00,549 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 5 [2019-08-05 10:13:01,033 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 5 [2019-08-05 10:13:01,046 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:13:01,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:01,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:01,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:01,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:01,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:01,048 INFO L87 Difference]: Start difference. First operand 1780 states and 2834 transitions. Second operand 5 states. [2019-08-05 10:13:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:01,806 INFO L93 Difference]: Finished difference Result 1829 states and 2887 transitions. [2019-08-05 10:13:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:01,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:13:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:01,817 INFO L225 Difference]: With dead ends: 1829 [2019-08-05 10:13:01,817 INFO L226 Difference]: Without dead ends: 1829 [2019-08-05 10:13:01,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-08-05 10:13:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2019-08-05 10:13:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2019-08-05 10:13:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2887 transitions. [2019-08-05 10:13:01,858 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2887 transitions. Word has length 35 [2019-08-05 10:13:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:01,858 INFO L475 AbstractCegarLoop]: Abstraction has 1829 states and 2887 transitions. [2019-08-05 10:13:01,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2887 transitions. [2019-08-05 10:13:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:13:01,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:01,862 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:13:01,862 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:01,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:01,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1941441835, now seen corresponding path program 1 times [2019-08-05 10:13:01,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:01,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:01,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:01,982 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:13:01,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:01,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:01,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:01,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:01,984 INFO L87 Difference]: Start difference. First operand 1829 states and 2887 transitions. Second operand 3 states. [2019-08-05 10:13:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:02,196 INFO L93 Difference]: Finished difference Result 2663 states and 4063 transitions. [2019-08-05 10:13:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:02,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:13:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:02,210 INFO L225 Difference]: With dead ends: 2663 [2019-08-05 10:13:02,210 INFO L226 Difference]: Without dead ends: 2631 [2019-08-05 10:13:02,211 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:13:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-08-05 10:13:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2629. [2019-08-05 10:13:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-08-05 10:13:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4031 transitions. [2019-08-05 10:13:02,305 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4031 transitions. Word has length 60 [2019-08-05 10:13:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:02,307 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4031 transitions. [2019-08-05 10:13:02,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4031 transitions. [2019-08-05 10:13:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:13:02,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:02,309 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:13:02,310 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:02,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1650973313, now seen corresponding path program 1 times [2019-08-05 10:13:02,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:02,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:02,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:02,396 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:13:02,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:02,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:02,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:02,398 INFO L87 Difference]: Start difference. First operand 2629 states and 4031 transitions. Second operand 3 states. [2019-08-05 10:13:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:02,569 INFO L93 Difference]: Finished difference Result 3895 states and 5791 transitions. [2019-08-05 10:13:02,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:02,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-08-05 10:13:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:02,587 INFO L225 Difference]: With dead ends: 3895 [2019-08-05 10:13:02,587 INFO L226 Difference]: Without dead ends: 3895 [2019-08-05 10:13:02,589 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:13:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2019-08-05 10:13:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3893. [2019-08-05 10:13:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3893 states. [2019-08-05 10:13:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5791 transitions. [2019-08-05 10:13:02,659 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5791 transitions. Word has length 63 [2019-08-05 10:13:02,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:02,659 INFO L475 AbstractCegarLoop]: Abstraction has 3893 states and 5791 transitions. [2019-08-05 10:13:02,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5791 transitions. [2019-08-05 10:13:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:13:02,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:02,662 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:13:02,662 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash 919830319, now seen corresponding path program 1 times [2019-08-05 10:13:02,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:02,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:02,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:02,753 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:13:02,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:02,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:02,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:02,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:02,755 INFO L87 Difference]: Start difference. First operand 3893 states and 5791 transitions. Second operand 3 states. [2019-08-05 10:13:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:03,106 INFO L93 Difference]: Finished difference Result 3819 states and 5559 transitions. [2019-08-05 10:13:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:03,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-08-05 10:13:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:03,121 INFO L225 Difference]: With dead ends: 3819 [2019-08-05 10:13:03,122 INFO L226 Difference]: Without dead ends: 3745 [2019-08-05 10:13:03,122 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:13:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-08-05 10:13:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3721. [2019-08-05 10:13:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-08-05 10:13:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5461 transitions. [2019-08-05 10:13:03,178 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5461 transitions. Word has length 68 [2019-08-05 10:13:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:03,179 INFO L475 AbstractCegarLoop]: Abstraction has 3721 states and 5461 transitions. [2019-08-05 10:13:03,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5461 transitions. [2019-08-05 10:13:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:13:03,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:03,184 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:13:03,184 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash 373368093, now seen corresponding path program 1 times [2019-08-05 10:13:03,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:03,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:03,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:03,355 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:13:03,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:03,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:03,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:03,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:03,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:03,357 INFO L87 Difference]: Start difference. First operand 3721 states and 5461 transitions. Second operand 5 states. [2019-08-05 10:13:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:04,376 INFO L93 Difference]: Finished difference Result 4653 states and 6755 transitions. [2019-08-05 10:13:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:04,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-08-05 10:13:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:04,409 INFO L225 Difference]: With dead ends: 4653 [2019-08-05 10:13:04,410 INFO L226 Difference]: Without dead ends: 4649 [2019-08-05 10:13:04,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 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:13:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-08-05 10:13:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4517. [2019-08-05 10:13:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4517 states. [2019-08-05 10:13:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6562 transitions. [2019-08-05 10:13:04,601 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6562 transitions. Word has length 70 [2019-08-05 10:13:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:04,602 INFO L475 AbstractCegarLoop]: Abstraction has 4517 states and 6562 transitions. [2019-08-05 10:13:04,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6562 transitions. [2019-08-05 10:13:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:13:04,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:04,605 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:13:04,605 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:04,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:04,606 INFO L82 PathProgramCache]: Analyzing trace with hash -30411294, now seen corresponding path program 1 times [2019-08-05 10:13:04,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:04,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:13:04,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:04,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,255 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2019-08-05 10:13:05,954 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 9 [2019-08-05 10:13:05,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,307 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:13:06,334 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:13:06,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:13:06,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:06,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:06,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:06,336 INFO L87 Difference]: Start difference. First operand 4517 states and 6562 transitions. Second operand 6 states. [2019-08-05 10:13:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,811 INFO L93 Difference]: Finished difference Result 4755 states and 6848 transitions. [2019-08-05 10:13:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:13:06,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-08-05 10:13:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,833 INFO L225 Difference]: With dead ends: 4755 [2019-08-05 10:13:06,834 INFO L226 Difference]: Without dead ends: 4755 [2019-08-05 10:13:06,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-08-05 10:13:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4732. [2019-08-05 10:13:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-08-05 10:13:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6824 transitions. [2019-08-05 10:13:06,906 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6824 transitions. Word has length 70 [2019-08-05 10:13:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,906 INFO L475 AbstractCegarLoop]: Abstraction has 4732 states and 6824 transitions. [2019-08-05 10:13:06,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6824 transitions. [2019-08-05 10:13:06,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:13:06,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,908 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:13:06,908 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179452, now seen corresponding path program 1 times [2019-08-05 10:13:06,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,094 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:13:07,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:07,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:07,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:07,098 INFO L87 Difference]: Start difference. First operand 4732 states and 6824 transitions. Second operand 5 states. [2019-08-05 10:13:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,573 INFO L93 Difference]: Finished difference Result 4812 states and 6942 transitions. [2019-08-05 10:13:07,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:07,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-08-05 10:13:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,584 INFO L225 Difference]: With dead ends: 4812 [2019-08-05 10:13:07,584 INFO L226 Difference]: Without dead ends: 4800 [2019-08-05 10:13:07,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 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:13:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2019-08-05 10:13:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 4665. [2019-08-05 10:13:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-08-05 10:13:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6738 transitions. [2019-08-05 10:13:07,662 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 6738 transitions. Word has length 71 [2019-08-05 10:13:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,662 INFO L475 AbstractCegarLoop]: Abstraction has 4665 states and 6738 transitions. [2019-08-05 10:13:07,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 6738 transitions. [2019-08-05 10:13:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:13:07,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,664 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:13:07,664 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2074252044, now seen corresponding path program 1 times [2019-08-05 10:13:07,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,948 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,217 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:13:08,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:08,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:08,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:08,219 INFO L87 Difference]: Start difference. First operand 4665 states and 6738 transitions. Second operand 7 states. [2019-08-05 10:13:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,672 INFO L93 Difference]: Finished difference Result 4905 states and 7026 transitions. [2019-08-05 10:13:08,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:13:08,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-08-05 10:13:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,682 INFO L225 Difference]: With dead ends: 4905 [2019-08-05 10:13:08,682 INFO L226 Difference]: Without dead ends: 4905 [2019-08-05 10:13:08,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:13:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-08-05 10:13:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4902. [2019-08-05 10:13:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4902 states. [2019-08-05 10:13:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 7023 transitions. [2019-08-05 10:13:08,736 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 7023 transitions. Word has length 105 [2019-08-05 10:13:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,736 INFO L475 AbstractCegarLoop]: Abstraction has 4902 states and 7023 transitions. [2019-08-05 10:13:08,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 7023 transitions. [2019-08-05 10:13:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:13:08,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,738 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:13:08,738 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1809599206, now seen corresponding path program 1 times [2019-08-05 10:13:08,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:09,407 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:13:09,472 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:13:09,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:13:09,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:09,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:09,473 INFO L87 Difference]: Start difference. First operand 4902 states and 7023 transitions. Second operand 5 states. [2019-08-05 10:13:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,685 INFO L93 Difference]: Finished difference Result 5173 states and 7346 transitions. [2019-08-05 10:13:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:09,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-08-05 10:13:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,707 INFO L225 Difference]: With dead ends: 5173 [2019-08-05 10:13:09,707 INFO L226 Difference]: Without dead ends: 5173 [2019-08-05 10:13:09,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-08-05 10:13:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5155. [2019-08-05 10:13:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5155 states. [2019-08-05 10:13:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 7328 transitions. [2019-08-05 10:13:09,770 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 7328 transitions. Word has length 107 [2019-08-05 10:13:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,770 INFO L475 AbstractCegarLoop]: Abstraction has 5155 states and 7328 transitions. [2019-08-05 10:13:09,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 7328 transitions. [2019-08-05 10:13:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-05 10:13:09,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,772 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:13:09,773 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1148551150, now seen corresponding path program 1 times [2019-08-05 10:13:09,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,969 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:13:09,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:13:09,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:09,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:09,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:09,972 INFO L87 Difference]: Start difference. First operand 5155 states and 7328 transitions. Second operand 4 states. [2019-08-05 10:13:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,358 INFO L93 Difference]: Finished difference Result 11604 states and 16347 transitions. [2019-08-05 10:13:12,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:12,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-08-05 10:13:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,384 INFO L225 Difference]: With dead ends: 11604 [2019-08-05 10:13:12,384 INFO L226 Difference]: Without dead ends: 11556 [2019-08-05 10:13:12,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11556 states. [2019-08-05 10:13:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11556 to 10967. [2019-08-05 10:13:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-08-05 10:13:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15524 transitions. [2019-08-05 10:13:12,534 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15524 transitions. Word has length 130 [2019-08-05 10:13:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,535 INFO L475 AbstractCegarLoop]: Abstraction has 10967 states and 15524 transitions. [2019-08-05 10:13:12,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15524 transitions. [2019-08-05 10:13:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 10:13:12,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:12,538 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:13:12,538 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:12,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:12,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2126953540, now seen corresponding path program 1 times [2019-08-05 10:13:12,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:12,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:12,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:12,651 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:13:12,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:12,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:12,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:12,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:12,653 INFO L87 Difference]: Start difference. First operand 10967 states and 15524 transitions. Second operand 3 states. [2019-08-05 10:13:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:13,218 INFO L93 Difference]: Finished difference Result 15551 states and 21862 transitions. [2019-08-05 10:13:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:13,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-08-05 10:13:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:13,360 INFO L225 Difference]: With dead ends: 15551 [2019-08-05 10:13:13,360 INFO L226 Difference]: Without dead ends: 15455 [2019-08-05 10:13:13,361 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:13:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15455 states. [2019-08-05 10:13:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15455 to 15373. [2019-08-05 10:13:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2019-08-05 10:13:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 21682 transitions. [2019-08-05 10:13:13,620 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 21682 transitions. Word has length 134 [2019-08-05 10:13:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:13,620 INFO L475 AbstractCegarLoop]: Abstraction has 15373 states and 21682 transitions. [2019-08-05 10:13:13,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 21682 transitions. [2019-08-05 10:13:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 10:13:13,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:13,625 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:13:13,625 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash 887643078, now seen corresponding path program 1 times [2019-08-05 10:13:13,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:13,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:13,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:13,744 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:13:13,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:13,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:13,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:13,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:13,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:13,746 INFO L87 Difference]: Start difference. First operand 15373 states and 21682 transitions. Second operand 3 states. [2019-08-05 10:13:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:14,238 INFO L93 Difference]: Finished difference Result 20487 states and 28307 transitions. [2019-08-05 10:13:14,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:14,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-08-05 10:13:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:14,273 INFO L225 Difference]: With dead ends: 20487 [2019-08-05 10:13:14,273 INFO L226 Difference]: Without dead ends: 20487 [2019-08-05 10:13:14,273 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:13:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20487 states. [2019-08-05 10:13:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20487 to 20051. [2019-08-05 10:13:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20051 states. [2019-08-05 10:13:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20051 states to 20051 states and 27873 transitions. [2019-08-05 10:13:14,642 INFO L78 Accepts]: Start accepts. Automaton has 20051 states and 27873 transitions. Word has length 138 [2019-08-05 10:13:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:14,643 INFO L475 AbstractCegarLoop]: Abstraction has 20051 states and 27873 transitions. [2019-08-05 10:13:14,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 20051 states and 27873 transitions. [2019-08-05 10:13:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:13:14,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:14,648 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:13:14,648 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash 11293620, now seen corresponding path program 1 times [2019-08-05 10:13:14,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:14,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:13:14,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:14,866 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:14,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,285 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2019-08-05 10:13:15,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:15,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,334 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2019-08-05 10:13:16,744 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2019-08-05 10:13:17,103 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:13:17,372 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-08-05 10:13:17,742 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-08-05 10:13:17,965 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-08-05 10:13:18,197 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-08-05 10:13:18,959 WARN L188 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-08-05 10:13:19,140 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-08-05 10:13:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 10:13:19,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:19,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:13:19,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:13:19,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:13:19,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=159, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:13:19,231 INFO L87 Difference]: Start difference. First operand 20051 states and 27873 transitions. Second operand 17 states. [2019-08-05 10:13:19,745 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-08-05 10:13:21,088 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-08-05 10:13:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:21,145 INFO L93 Difference]: Finished difference Result 50067 states and 67610 transitions. [2019-08-05 10:13:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:13:21,146 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 139 [2019-08-05 10:13:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:21,214 INFO L225 Difference]: With dead ends: 50067 [2019-08-05 10:13:21,215 INFO L226 Difference]: Without dead ends: 49795 [2019-08-05 10:13:21,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49795 states. [2019-08-05 10:13:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49795 to 41787. [2019-08-05 10:13:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41787 states. [2019-08-05 10:13:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41787 states to 41787 states and 57081 transitions. [2019-08-05 10:13:21,832 INFO L78 Accepts]: Start accepts. Automaton has 41787 states and 57081 transitions. Word has length 139 [2019-08-05 10:13:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:21,833 INFO L475 AbstractCegarLoop]: Abstraction has 41787 states and 57081 transitions. [2019-08-05 10:13:21,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:13:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 41787 states and 57081 transitions. [2019-08-05 10:13:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:13:21,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:21,835 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:13:21,836 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1823249627, now seen corresponding path program 1 times [2019-08-05 10:13:21,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:21,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:13:21,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:22,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,540 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2019-08-05 10:13:22,587 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:13:22,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:22,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:22,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:22,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:22,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:22,589 INFO L87 Difference]: Start difference. First operand 41787 states and 57081 transitions. Second operand 7 states. [2019-08-05 10:13:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:23,181 INFO L93 Difference]: Finished difference Result 44207 states and 60047 transitions. [2019-08-05 10:13:23,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:23,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-08-05 10:13:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:23,229 INFO L225 Difference]: With dead ends: 44207 [2019-08-05 10:13:23,229 INFO L226 Difference]: Without dead ends: 44207 [2019-08-05 10:13:23,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44207 states. [2019-08-05 10:13:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44207 to 44145. [2019-08-05 10:13:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44145 states. [2019-08-05 10:13:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44145 states to 44145 states and 59985 transitions. [2019-08-05 10:13:23,658 INFO L78 Accepts]: Start accepts. Automaton has 44145 states and 59985 transitions. Word has length 143 [2019-08-05 10:13:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:23,659 INFO L475 AbstractCegarLoop]: Abstraction has 44145 states and 59985 transitions. [2019-08-05 10:13:23,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 44145 states and 59985 transitions. [2019-08-05 10:13:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-05 10:13:23,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:23,662 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, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:23,662 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:23,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1030830050, now seen corresponding path program 1 times [2019-08-05 10:13:23,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:23,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:13:23,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:23,926 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:13:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 10:13:24,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:24,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:13:24,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:24,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:24,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:24,090 INFO L87 Difference]: Start difference. First operand 44145 states and 59985 transitions. Second operand 5 states. [2019-08-05 10:13:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:24,363 INFO L93 Difference]: Finished difference Result 44144 states and 59480 transitions. [2019-08-05 10:13:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:24,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-08-05 10:13:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:24,404 INFO L225 Difference]: With dead ends: 44144 [2019-08-05 10:13:24,405 INFO L226 Difference]: Without dead ends: 44144 [2019-08-05 10:13:24,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44144 states. [2019-08-05 10:13:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44144 to 42141. [2019-08-05 10:13:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42141 states. [2019-08-05 10:13:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42141 states to 42141 states and 57031 transitions. [2019-08-05 10:13:25,641 INFO L78 Accepts]: Start accepts. Automaton has 42141 states and 57031 transitions. Word has length 154 [2019-08-05 10:13:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:25,642 INFO L475 AbstractCegarLoop]: Abstraction has 42141 states and 57031 transitions. [2019-08-05 10:13:25,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 42141 states and 57031 transitions. [2019-08-05 10:13:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 10:13:25,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,645 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:13:25,646 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1674424068, now seen corresponding path program 1 times [2019-08-05 10:13:25,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,746 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:13:25,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:25,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:25,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:25,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:25,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:25,747 INFO L87 Difference]: Start difference. First operand 42141 states and 57031 transitions. Second operand 3 states. [2019-08-05 10:13:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:26,008 INFO L93 Difference]: Finished difference Result 45305 states and 61017 transitions. [2019-08-05 10:13:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:26,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-08-05 10:13:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:26,061 INFO L225 Difference]: With dead ends: 45305 [2019-08-05 10:13:26,062 INFO L226 Difference]: Without dead ends: 45237 [2019-08-05 10:13:26,062 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:13:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45237 states. [2019-08-05 10:13:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45237 to 45188. [2019-08-05 10:13:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45188 states. [2019-08-05 10:13:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45188 states to 45188 states and 60877 transitions. [2019-08-05 10:13:26,717 INFO L78 Accepts]: Start accepts. Automaton has 45188 states and 60877 transitions. Word has length 171 [2019-08-05 10:13:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:26,718 INFO L475 AbstractCegarLoop]: Abstraction has 45188 states and 60877 transitions. [2019-08-05 10:13:26,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 45188 states and 60877 transitions. [2019-08-05 10:13:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 10:13:26,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:26,723 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:13:26,723 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:26,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:26,723 INFO L82 PathProgramCache]: Analyzing trace with hash -110644143, now seen corresponding path program 1 times [2019-08-05 10:13:26,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:26,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:26,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:26,829 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:13:26,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:26,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:26,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:26,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:26,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:26,831 INFO L87 Difference]: Start difference. First operand 45188 states and 60877 transitions. Second operand 3 states. [2019-08-05 10:13:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,110 INFO L93 Difference]: Finished difference Result 49169 states and 66073 transitions. [2019-08-05 10:13:27,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:27,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-08-05 10:13:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,158 INFO L225 Difference]: With dead ends: 49169 [2019-08-05 10:13:27,158 INFO L226 Difference]: Without dead ends: 49121 [2019-08-05 10:13:27,159 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:13:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49121 states. [2019-08-05 10:13:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49121 to 47260. [2019-08-05 10:13:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47260 states. [2019-08-05 10:13:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47260 states to 47260 states and 63585 transitions. [2019-08-05 10:13:27,524 INFO L78 Accepts]: Start accepts. Automaton has 47260 states and 63585 transitions. Word has length 173 [2019-08-05 10:13:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,524 INFO L475 AbstractCegarLoop]: Abstraction has 47260 states and 63585 transitions. [2019-08-05 10:13:27,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 47260 states and 63585 transitions. [2019-08-05 10:13:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 10:13:27,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,528 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:13:27,528 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash 369991458, now seen corresponding path program 1 times [2019-08-05 10:13:27,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,704 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:27,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,586 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 5 [2019-08-05 10:13:30,352 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:13:30,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:30,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:13:30,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:30,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:30,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:30,354 INFO L87 Difference]: Start difference. First operand 47260 states and 63585 transitions. Second operand 8 states. [2019-08-05 10:13:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:31,205 INFO L93 Difference]: Finished difference Result 51395 states and 68696 transitions. [2019-08-05 10:13:31,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:13:31,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-08-05 10:13:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:31,254 INFO L225 Difference]: With dead ends: 51395 [2019-08-05 10:13:31,254 INFO L226 Difference]: Without dead ends: 51395 [2019-08-05 10:13:31,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51395 states. [2019-08-05 10:13:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51395 to 50959. [2019-08-05 10:13:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50959 states. [2019-08-05 10:13:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50959 states to 50959 states and 68232 transitions. [2019-08-05 10:13:31,664 INFO L78 Accepts]: Start accepts. Automaton has 50959 states and 68232 transitions. Word has length 174 [2019-08-05 10:13:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:31,665 INFO L475 AbstractCegarLoop]: Abstraction has 50959 states and 68232 transitions. [2019-08-05 10:13:31,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 50959 states and 68232 transitions. [2019-08-05 10:13:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-05 10:13:31,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:31,669 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, 4, 4, 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:13:31,669 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1740255584, now seen corresponding path program 2 times [2019-08-05 10:13:31,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:31,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:13:31,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:31,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:31,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 31 proven. 244 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 10:13:32,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:32,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:13:32,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:13:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:13:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:32,344 INFO L87 Difference]: Start difference. First operand 50959 states and 68232 transitions. Second operand 9 states. [2019-08-05 10:13:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:33,139 INFO L93 Difference]: Finished difference Result 53082 states and 70843 transitions. [2019-08-05 10:13:33,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:13:33,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-08-05 10:13:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:33,199 INFO L225 Difference]: With dead ends: 53082 [2019-08-05 10:13:33,199 INFO L226 Difference]: Without dead ends: 53082 [2019-08-05 10:13:33,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:13:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53082 states. [2019-08-05 10:13:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53082 to 51077. [2019-08-05 10:13:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51077 states. [2019-08-05 10:13:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51077 states to 51077 states and 68378 transitions. [2019-08-05 10:13:33,630 INFO L78 Accepts]: Start accepts. Automaton has 51077 states and 68378 transitions. Word has length 176 [2019-08-05 10:13:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:33,630 INFO L475 AbstractCegarLoop]: Abstraction has 51077 states and 68378 transitions. [2019-08-05 10:13:33,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:13:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51077 states and 68378 transitions. [2019-08-05 10:13:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 10:13:33,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:33,635 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:13:33,635 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash -758038053, now seen corresponding path program 1 times [2019-08-05 10:13:33,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:33,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:13:33,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:33,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:33,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,729 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 15 [2019-08-05 10:13:34,975 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-08-05 10:13:35,405 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-08-05 10:13:35,776 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-08-05 10:13:36,173 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:13:36,612 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 10:13:36,911 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:13:37,206 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-08-05 10:13:38,443 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-08-05 10:13:38,679 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-08-05 10:13:38,876 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-08-05 10:13:38,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 262 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 10:13:39,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:39,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:13:39,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:13:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:13:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:13:39,143 INFO L87 Difference]: Start difference. First operand 51077 states and 68378 transitions. Second operand 21 states. [2019-08-05 10:13:40,242 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-08-05 10:13:41,025 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-08-05 10:13:41,300 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-08-05 10:13:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:44,216 INFO L93 Difference]: Finished difference Result 139910 states and 184630 transitions. [2019-08-05 10:13:44,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:13:44,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 177 [2019-08-05 10:13:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:44,379 INFO L225 Difference]: With dead ends: 139910 [2019-08-05 10:13:44,380 INFO L226 Difference]: Without dead ends: 139822 [2019-08-05 10:13:44,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:13:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139822 states. [2019-08-05 10:13:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139822 to 108719. [2019-08-05 10:13:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108719 states. [2019-08-05 10:13:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108719 states to 108719 states and 145190 transitions. [2019-08-05 10:13:45,701 INFO L78 Accepts]: Start accepts. Automaton has 108719 states and 145190 transitions. Word has length 177 [2019-08-05 10:13:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:45,701 INFO L475 AbstractCegarLoop]: Abstraction has 108719 states and 145190 transitions. [2019-08-05 10:13:45,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:13:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 108719 states and 145190 transitions. [2019-08-05 10:13:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:13:45,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:45,708 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:13:45,709 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2127775696, now seen corresponding path program 1 times [2019-08-05 10:13:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:45,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:45,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:45,828 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:13:45,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:45,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:45,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:45,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:45,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:45,829 INFO L87 Difference]: Start difference. First operand 108719 states and 145190 transitions. Second operand 3 states. [2019-08-05 10:13:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:46,713 INFO L93 Difference]: Finished difference Result 143630 states and 190706 transitions. [2019-08-05 10:13:46,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:46,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-08-05 10:13:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:48,858 INFO L225 Difference]: With dead ends: 143630 [2019-08-05 10:13:48,858 INFO L226 Difference]: Without dead ends: 142966 [2019-08-05 10:13:48,859 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:13:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142966 states. [2019-08-05 10:13:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142966 to 142965. [2019-08-05 10:13:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142965 states. [2019-08-05 10:13:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142965 states to 142965 states and 189239 transitions. [2019-08-05 10:13:50,091 INFO L78 Accepts]: Start accepts. Automaton has 142965 states and 189239 transitions. Word has length 200 [2019-08-05 10:13:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:50,091 INFO L475 AbstractCegarLoop]: Abstraction has 142965 states and 189239 transitions. [2019-08-05 10:13:50,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 142965 states and 189239 transitions. [2019-08-05 10:13:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 10:13:50,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:50,098 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:13:50,099 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:50,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash -67160481, now seen corresponding path program 1 times [2019-08-05 10:13:50,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:50,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:13:50,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:50,347 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:50,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,927 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,036 WARN L188 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-08-05 10:13:52,420 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-08-05 10:13:52,766 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:13:53,088 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 10:13:53,383 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:13:53,656 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-08-05 10:13:53,895 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-08-05 10:13:54,127 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-08-05 10:13:54,357 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-08-05 10:13:54,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,448 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:54,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 22 proven. 382 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 10:13:55,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:55,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:13:55,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:13:55,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:13:55,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:55,170 INFO L87 Difference]: Start difference. First operand 142965 states and 189239 transitions. Second operand 26 states. [2019-08-05 10:13:56,366 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-08-05 10:13:56,592 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 23 [2019-08-05 10:13:57,420 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-08-05 10:14:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:03,658 INFO L93 Difference]: Finished difference Result 318463 states and 427742 transitions. [2019-08-05 10:14:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:14:03,659 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 203 [2019-08-05 10:14:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:03,894 INFO L225 Difference]: With dead ends: 318463 [2019-08-05 10:14:03,895 INFO L226 Difference]: Without dead ends: 173939 [2019-08-05 10:14:03,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=674, Invalid=1978, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:14:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173939 states. [2019-08-05 10:14:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173939 to 146393. [2019-08-05 10:14:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146393 states. [2019-08-05 10:14:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146393 states to 146393 states and 199470 transitions. [2019-08-05 10:14:06,039 INFO L78 Accepts]: Start accepts. Automaton has 146393 states and 199470 transitions. Word has length 203 [2019-08-05 10:14:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:06,039 INFO L475 AbstractCegarLoop]: Abstraction has 146393 states and 199470 transitions. [2019-08-05 10:14:06,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:14:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 146393 states and 199470 transitions. [2019-08-05 10:14:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-05 10:14:06,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:06,044 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, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:06,044 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:06,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:06,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2111197963, now seen corresponding path program 1 times [2019-08-05 10:14:06,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:06,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:14:06,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:06,276 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:14:06,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,963 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 13 [2019-08-05 10:14:07,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:07,759 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-08-05 10:14:08,096 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-08-05 10:14:08,395 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-08-05 10:14:08,673 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-08-05 10:14:08,927 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-08-05 10:14:09,147 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-08-05 10:14:09,339 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:14:09,521 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:14:09,676 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:14:09,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 10 proven. 382 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-08-05 10:14:09,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:09,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:14:09,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:14:09,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:14:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:14:09,996 INFO L87 Difference]: Start difference. First operand 146393 states and 199470 transitions. Second operand 19 states. [2019-08-05 10:14:10,425 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-08-05 10:14:10,836 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-08-05 10:14:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:11,893 INFO L93 Difference]: Finished difference Result 175293 states and 236101 transitions. [2019-08-05 10:14:11,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:14:11,894 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2019-08-05 10:14:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:12,112 INFO L225 Difference]: With dead ends: 175293 [2019-08-05 10:14:12,112 INFO L226 Difference]: Without dead ends: 175293 [2019-08-05 10:14:12,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:14:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175293 states. [2019-08-05 10:14:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175293 to 150526. [2019-08-05 10:14:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150526 states. [2019-08-05 10:14:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150526 states to 150526 states and 204544 transitions. [2019-08-05 10:14:16,299 INFO L78 Accepts]: Start accepts. Automaton has 150526 states and 204544 transitions. Word has length 206 [2019-08-05 10:14:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:16,300 INFO L475 AbstractCegarLoop]: Abstraction has 150526 states and 204544 transitions. [2019-08-05 10:14:16,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:14:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 150526 states and 204544 transitions. [2019-08-05 10:14:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-05 10:14:16,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:16,311 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:16,311 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1086801388, now seen corresponding path program 1 times [2019-08-05 10:14:16,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:16,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:14:16,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 264 proven. 217 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 10:14:16,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:16,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:14:16,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:14:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:14:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:14:16,623 INFO L87 Difference]: Start difference. First operand 150526 states and 204544 transitions. Second operand 6 states. [2019-08-05 10:14:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:17,580 INFO L93 Difference]: Finished difference Result 219422 states and 297466 transitions. [2019-08-05 10:14:17,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:14:17,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 232 [2019-08-05 10:14:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:18,822 INFO L225 Difference]: With dead ends: 219422 [2019-08-05 10:14:18,822 INFO L226 Difference]: Without dead ends: 219422 [2019-08-05 10:14:18,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219422 states. [2019-08-05 10:14:20,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219422 to 139071. [2019-08-05 10:14:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139071 states. [2019-08-05 10:14:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139071 states to 139071 states and 189672 transitions. [2019-08-05 10:14:20,390 INFO L78 Accepts]: Start accepts. Automaton has 139071 states and 189672 transitions. Word has length 232 [2019-08-05 10:14:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:20,390 INFO L475 AbstractCegarLoop]: Abstraction has 139071 states and 189672 transitions. [2019-08-05 10:14:20,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:14:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 139071 states and 189672 transitions. [2019-08-05 10:14:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-08-05 10:14:20,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:20,398 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:20,398 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:20,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash -656167012, now seen corresponding path program 1 times [2019-08-05 10:14:20,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:20,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:14:20,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-08-05 10:14:20,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:20,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:14:20,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:14:20,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:14:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:20,512 INFO L87 Difference]: Start difference. First operand 139071 states and 189672 transitions. Second operand 3 states. [2019-08-05 10:14:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:23,496 INFO L93 Difference]: Finished difference Result 173048 states and 235330 transitions. [2019-08-05 10:14:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:14:23,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-08-05 10:14:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:23,729 INFO L225 Difference]: With dead ends: 173048 [2019-08-05 10:14:23,729 INFO L226 Difference]: Without dead ends: 173048 [2019-08-05 10:14:23,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 237 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:14:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173048 states. [2019-08-05 10:14:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173048 to 170208. [2019-08-05 10:14:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170208 states. [2019-08-05 10:14:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170208 states to 170208 states and 231932 transitions. [2019-08-05 10:14:25,314 INFO L78 Accepts]: Start accepts. Automaton has 170208 states and 231932 transitions. Word has length 239 [2019-08-05 10:14:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:25,315 INFO L475 AbstractCegarLoop]: Abstraction has 170208 states and 231932 transitions. [2019-08-05 10:14:25,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:14:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 170208 states and 231932 transitions. [2019-08-05 10:14:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-08-05 10:14:25,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:25,323 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:25,323 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1398636289, now seen corresponding path program 1 times [2019-08-05 10:14:25,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:25,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:14:25,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:25,551 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:14:25,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,553 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:26,195 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-08-05 10:14:26,540 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-08-05 10:14:26,991 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-08-05 10:14:27,306 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-08-05 10:14:27,618 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-08-05 10:14:27,839 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-08-05 10:14:28,039 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-08-05 10:14:28,214 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-08-05 10:14:28,367 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:14:28,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,433 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,475 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 10 proven. 513 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 10:14:29,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:29,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:14:29,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:14:29,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:14:29,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:14:29,211 INFO L87 Difference]: Start difference. First operand 170208 states and 231932 transitions. Second operand 20 states. [2019-08-05 10:14:29,762 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-08-05 10:14:30,221 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-08-05 10:14:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:31,597 INFO L93 Difference]: Finished difference Result 174467 states and 236899 transitions. [2019-08-05 10:14:31,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:14:31,598 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 241 [2019-08-05 10:14:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:31,811 INFO L225 Difference]: With dead ends: 174467 [2019-08-05 10:14:31,812 INFO L226 Difference]: Without dead ends: 174467 [2019-08-05 10:14:31,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=201, Invalid=351, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:14:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174467 states. [2019-08-05 10:14:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174467 to 172038. [2019-08-05 10:14:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172038 states. [2019-08-05 10:14:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172038 states to 172038 states and 234228 transitions. [2019-08-05 10:14:37,500 INFO L78 Accepts]: Start accepts. Automaton has 172038 states and 234228 transitions. Word has length 241 [2019-08-05 10:14:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:37,500 INFO L475 AbstractCegarLoop]: Abstraction has 172038 states and 234228 transitions. [2019-08-05 10:14:37,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:14:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 172038 states and 234228 transitions. [2019-08-05 10:14:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-08-05 10:14:37,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:37,510 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:37,510 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash -492046394, now seen corresponding path program 1 times [2019-08-05 10:14:37,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:37,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:14:37,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-08-05 10:14:37,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:37,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:14:37,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:14:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:14:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:37,655 INFO L87 Difference]: Start difference. First operand 172038 states and 234228 transitions. Second operand 3 states. [2019-08-05 10:14:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:38,142 INFO L93 Difference]: Finished difference Result 172860 states and 232392 transitions. [2019-08-05 10:14:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:14:38,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-08-05 10:14:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:38,346 INFO L225 Difference]: With dead ends: 172860 [2019-08-05 10:14:38,347 INFO L226 Difference]: Without dead ends: 168700 [2019-08-05 10:14:38,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168700 states. [2019-08-05 10:14:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168700 to 135101. [2019-08-05 10:14:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135101 states. [2019-08-05 10:14:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135101 states to 135101 states and 181559 transitions. [2019-08-05 10:14:39,753 INFO L78 Accepts]: Start accepts. Automaton has 135101 states and 181559 transitions. Word has length 251 [2019-08-05 10:14:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:39,753 INFO L475 AbstractCegarLoop]: Abstraction has 135101 states and 181559 transitions. [2019-08-05 10:14:39,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:14:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 135101 states and 181559 transitions. [2019-08-05 10:14:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-08-05 10:14:39,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:39,763 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:39,763 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1069176822, now seen corresponding path program 1 times [2019-08-05 10:14:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:39,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:14:39,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-08-05 10:14:39,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:39,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:14:39,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:14:39,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:14:39,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:39,885 INFO L87 Difference]: Start difference. First operand 135101 states and 181559 transitions. Second operand 3 states. [2019-08-05 10:14:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:40,755 INFO L93 Difference]: Finished difference Result 83875 states and 109525 transitions. [2019-08-05 10:14:40,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:14:40,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-08-05 10:14:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:40,850 INFO L225 Difference]: With dead ends: 83875 [2019-08-05 10:14:40,850 INFO L226 Difference]: Without dead ends: 82147 [2019-08-05 10:14:40,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82147 states. [2019-08-05 10:14:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82147 to 79504. [2019-08-05 10:14:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79504 states. [2019-08-05 10:14:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79504 states to 79504 states and 104607 transitions. [2019-08-05 10:14:41,528 INFO L78 Accepts]: Start accepts. Automaton has 79504 states and 104607 transitions. Word has length 254 [2019-08-05 10:14:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:41,528 INFO L475 AbstractCegarLoop]: Abstraction has 79504 states and 104607 transitions. [2019-08-05 10:14:41,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:14:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 79504 states and 104607 transitions. [2019-08-05 10:14:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-08-05 10:14:41,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:41,535 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:41,535 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash -960790162, now seen corresponding path program 1 times [2019-08-05 10:14:41,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:41,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:41,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 289 proven. 361 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-08-05 10:14:42,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:42,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:14:42,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:14:42,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:14:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:14:42,036 INFO L87 Difference]: Start difference. First operand 79504 states and 104607 transitions. Second operand 7 states. [2019-08-05 10:14:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:42,973 INFO L93 Difference]: Finished difference Result 91116 states and 118410 transitions. [2019-08-05 10:14:42,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:14:42,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2019-08-05 10:14:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:43,065 INFO L225 Difference]: With dead ends: 91116 [2019-08-05 10:14:43,065 INFO L226 Difference]: Without dead ends: 89676 [2019-08-05 10:14:43,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:14:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89676 states. [2019-08-05 10:14:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89676 to 84050. [2019-08-05 10:14:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84050 states. [2019-08-05 10:14:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84050 states to 84050 states and 110149 transitions. [2019-08-05 10:14:43,789 INFO L78 Accepts]: Start accepts. Automaton has 84050 states and 110149 transitions. Word has length 259 [2019-08-05 10:14:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:43,789 INFO L475 AbstractCegarLoop]: Abstraction has 84050 states and 110149 transitions. [2019-08-05 10:14:43,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:14:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 84050 states and 110149 transitions. [2019-08-05 10:14:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 10:14:43,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:43,796 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:43,796 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:43,796 INFO L82 PathProgramCache]: Analyzing trace with hash 411043388, now seen corresponding path program 1 times [2019-08-05 10:14:43,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:43,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:14:43,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-08-05 10:14:44,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:44,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:14:44,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:14:44,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:14:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:44,466 INFO L87 Difference]: Start difference. First operand 84050 states and 110149 transitions. Second operand 3 states. [2019-08-05 10:14:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:44,793 INFO L93 Difference]: Finished difference Result 102506 states and 132891 transitions. [2019-08-05 10:14:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:14:44,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-08-05 10:14:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:44,909 INFO L225 Difference]: With dead ends: 102506 [2019-08-05 10:14:44,909 INFO L226 Difference]: Without dead ends: 102488 [2019-08-05 10:14:44,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:14:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102488 states. [2019-08-05 10:14:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102488 to 102487. [2019-08-05 10:14:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102487 states. [2019-08-05 10:14:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102487 states to 102487 states and 132873 transitions. [2019-08-05 10:14:45,771 INFO L78 Accepts]: Start accepts. Automaton has 102487 states and 132873 transitions. Word has length 267 [2019-08-05 10:14:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:45,772 INFO L475 AbstractCegarLoop]: Abstraction has 102487 states and 132873 transitions. [2019-08-05 10:14:45,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:14:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 102487 states and 132873 transitions. [2019-08-05 10:14:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-08-05 10:14:45,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:45,778 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:45,779 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1390930393, now seen corresponding path program 1 times [2019-08-05 10:14:45,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:45,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:14:45,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:45,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,818 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-08-05 10:14:47,129 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-08-05 10:14:47,429 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-08-05 10:14:47,734 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-08-05 10:14:48,069 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-08-05 10:14:48,310 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-08-05 10:14:48,520 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-08-05 10:14:48,704 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-08-05 10:14:48,866 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-08-05 10:14:48,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 30 proven. 693 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 10:14:50,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:50,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:14:50,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:14:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:14:50,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:14:50,257 INFO L87 Difference]: Start difference. First operand 102487 states and 132873 transitions. Second operand 31 states. [2019-08-05 10:14:51,281 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-08-05 10:14:51,575 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:14:51,900 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-08-05 10:14:52,081 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-08-05 10:14:56,570 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-08-05 10:14:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:59,259 INFO L93 Difference]: Finished difference Result 239639 states and 306521 transitions. [2019-08-05 10:14:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:14:59,266 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 267 [2019-08-05 10:14:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:59,567 INFO L225 Difference]: With dead ends: 239639 [2019-08-05 10:14:59,567 INFO L226 Difference]: Without dead ends: 239579 [2019-08-05 10:14:59,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1125, Invalid=2781, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:14:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239579 states. [2019-08-05 10:15:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239579 to 172801. [2019-08-05 10:15:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172801 states. [2019-08-05 10:15:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172801 states to 172801 states and 224806 transitions. [2019-08-05 10:15:01,902 INFO L78 Accepts]: Start accepts. Automaton has 172801 states and 224806 transitions. Word has length 267 [2019-08-05 10:15:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:01,903 INFO L475 AbstractCegarLoop]: Abstraction has 172801 states and 224806 transitions. [2019-08-05 10:15:01,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:15:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 172801 states and 224806 transitions. [2019-08-05 10:15:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-08-05 10:15:01,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:01,918 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:01,918 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:01,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1557095743, now seen corresponding path program 1 times [2019-08-05 10:15:01,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:01,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:15:01,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-08-05 10:15:02,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:02,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:02,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:02,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:02,086 INFO L87 Difference]: Start difference. First operand 172801 states and 224806 transitions. Second operand 3 states. [2019-08-05 10:15:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:02,914 INFO L93 Difference]: Finished difference Result 212939 states and 277148 transitions. [2019-08-05 10:15:02,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:02,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-08-05 10:15:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:03,176 INFO L225 Difference]: With dead ends: 212939 [2019-08-05 10:15:03,177 INFO L226 Difference]: Without dead ends: 211367 [2019-08-05 10:15:03,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 273 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:15:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211367 states. [2019-08-05 10:15:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211367 to 209866. [2019-08-05 10:15:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209866 states. [2019-08-05 10:15:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209866 states to 209866 states and 272039 transitions. [2019-08-05 10:15:05,795 INFO L78 Accepts]: Start accepts. Automaton has 209866 states and 272039 transitions. Word has length 276 [2019-08-05 10:15:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:05,796 INFO L475 AbstractCegarLoop]: Abstraction has 209866 states and 272039 transitions. [2019-08-05 10:15:05,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 209866 states and 272039 transitions. [2019-08-05 10:15:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-08-05 10:15:05,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:05,814 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:05,815 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash 128348655, now seen corresponding path program 1 times [2019-08-05 10:15:05,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:05,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:15:05,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-08-05 10:15:06,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:06,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:06,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:06,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:06,193 INFO L87 Difference]: Start difference. First operand 209866 states and 272039 transitions. Second operand 6 states. [2019-08-05 10:15:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:07,880 INFO L93 Difference]: Finished difference Result 372452 states and 478901 transitions. [2019-08-05 10:15:07,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:15:07,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2019-08-05 10:15:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:07,881 INFO L225 Difference]: With dead ends: 372452 [2019-08-05 10:15:07,881 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:15:07,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:15:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:15:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:15:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:15:07,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2019-08-05 10:15:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:07,882 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:15:07,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:15:07,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:15:07,887 INFO L202 PluginConnector]: Adding new model u2b07_batman_intermittent_power_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:15:07 BoogieIcfgContainer [2019-08-05 10:15:07,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:15:07,889 INFO L168 Benchmark]: Toolchain (without parser) took 134364.04 ms. Allocated memory was 132.6 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 106.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-08-05 10:15:07,890 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 111.4 MB in the beginning and 111.2 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:15:07,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.25 ms. Allocated memory is still 132.6 MB. Free memory was 106.6 MB in the beginning and 104.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:07,891 INFO L168 Benchmark]: Boogie Preprocessor took 110.46 ms. Allocated memory is still 132.6 MB. Free memory was 104.4 MB in the beginning and 100.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:07,892 INFO L168 Benchmark]: RCFGBuilder took 4006.69 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 137.1 MB in the end (delta: -36.5 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:07,892 INFO L168 Benchmark]: TraceAbstraction took 130173.59 ms. Allocated memory was 195.6 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 137.1 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-08-05 10:15:07,895 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.25 ms. Allocated memory is still 132.6 MB. Free memory was 106.6 MB in the beginning and 104.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.46 ms. Allocated memory is still 132.6 MB. Free memory was 104.4 MB in the beginning and 100.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4006.69 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 137.1 MB in the end (delta: -36.5 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130173.59 ms. Allocated memory was 195.6 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 137.1 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 469]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 706]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. SAFE Result, 130.1s OverallTime, 39 OverallIterations, 9 TraceHistogramMax, 57.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7777 SDtfs, 18390 SDslu, 23615 SDs, 0 SdLazy, 12576 SolverSat, 2060 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5702 GetRequests, 5354 SyntacticMatches, 39 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209866occurred in iteration=38, 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: 32.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 295100 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 5629 NumberOfCodeBlocks, 5629 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 5590 ConstructedInterpolants, 0 QuantifiedInterpolants, 6747981 SizeOfPredicates, 154 NumberOfNonLiveVariables, 16299 ConjunctsInSsa, 415 ConjunctsInUnsatCore, 39 InterpolantComputations, 22 PerfectInterpolantSequences, 6988/11201 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...