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/abstractInterpretation/regression/open/int/loop-nondet.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:40,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:40,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:40,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:40,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:40,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:40,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:40,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:40,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:40,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:40,885 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:40,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:40,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:40,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:40,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:40,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:40,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:40,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:40,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:40,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:40,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:40,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:40,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:40,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:40,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:40,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:40,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:40,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:40,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:40,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:40,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:40,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:40,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:40,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:40,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:40,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:40,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:40,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:40,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:40,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:40,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:40,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:40,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:40,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:40,985 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:40,985 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:40,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/int/loop-nondet.bpl [2019-08-05 11:09:40,986 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/int/loop-nondet.bpl' [2019-08-05 11:09:41,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:41,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:41,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:41,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:41,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:41,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,053 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:09:41,055 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:09:41,055 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:09:41,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:41,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:41,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:41,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:41,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/1) ... [2019-08-05 11:09:41,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:41,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:41,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:41,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:41,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (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 11:09:41,154 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:09:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:09:41,154 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:09:41,423 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:09:41,424 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 11:09:41,425 INFO L202 PluginConnector]: Adding new model loop-nondet.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:41 BoogieIcfgContainer [2019-08-05 11:09:41,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:41,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:41,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:41,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:41,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:41" (1/2) ... [2019-08-05 11:09:41,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e76ff83 and model type loop-nondet.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:41, skipping insertion in model container [2019-08-05 11:09:41,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-nondet.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:41" (2/2) ... [2019-08-05 11:09:41,436 INFO L109 eAbstractionObserver]: Analyzing ICFG loop-nondet.bpl [2019-08-05 11:09:41,446 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:41,454 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:09:41,472 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:09:41,502 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:41,503 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:41,503 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:41,504 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:41,504 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:41,504 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:41,504 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:41,504 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:41,505 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:09:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:09:41,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:41,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:09:41,545 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:41,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash 29895, now seen corresponding path program 1 times [2019-08-05 11:09:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:41,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:41,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:41,689 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 11:09:41,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:41,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:09:41,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:41,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:41,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:41,712 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:09:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:41,787 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:09:41,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:41,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:09:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:41,801 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:09:41,801 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:09:41,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:09:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:09:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:09:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:09:41,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:09:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:41,837 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:09:41,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:09:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:09:41,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:41,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:09:41,839 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:41,839 INFO L82 PathProgramCache]: Analyzing trace with hash 927593, now seen corresponding path program 1 times [2019-08-05 11:09:41,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:41,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:41,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:41,902 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 11:09:41,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:41,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:09:41,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:41,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:41,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:41,910 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 11:09:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,011 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:09:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:42,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:09:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,013 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:09:42,014 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:09:42,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:09:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:09:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:09:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:09:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:09:42,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:09:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,019 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:09:42,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:09:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:09:42,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:09:42,021 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,021 INFO L82 PathProgramCache]: Analyzing trace with hash 28757068, now seen corresponding path program 1 times [2019-08-05 11:09:42,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:42,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 11:09:42,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:09:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:09:42,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:09:42,288 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 11:09:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,332 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:09:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:09:42,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:09:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,335 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:09:42,335 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:09:42,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:09:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:09:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:09:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:09:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:09:42,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:09:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,342 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:09:42,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:09:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:09:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:09:42,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,343 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:09:42,343 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1865766545, now seen corresponding path program 2 times [2019-08-05 11:09:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:42,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:09:42,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:42,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:42,481 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 11:09:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,518 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:09:42,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:42,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:09:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,519 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:09:42,519 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:09:42,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:09:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:09:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:09:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:09:42,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:09:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,533 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:09:42,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:09:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:09:42,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,534 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 11:09:42,534 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2000315286, now seen corresponding path program 3 times [2019-08-05 11:09:42,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:42,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:09:42,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:09:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:09:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:42,810 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 11:09:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,858 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:09:42,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:09:42,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:09:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,860 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:09:42,860 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:09:42,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:09:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:09:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:09:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:09:42,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:09:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,864 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:09:42,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:09:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:09:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:09:42,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,865 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2019-08-05 11:09:42,865 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1842330789, now seen corresponding path program 4 times [2019-08-05 11:09:42,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:43,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:43,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:43,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:43,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:43,075 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-05 11:09:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:43,143 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:09:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:43,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:09:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:43,151 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:09:43,152 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:09:43,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:09:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:09:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:09:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:09:43,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:09:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:43,157 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:09:43,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:09:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:09:43,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:43,159 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2019-08-05 11:09:43,159 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash -953334304, now seen corresponding path program 5 times [2019-08-05 11:09:43,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:43,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:09:43,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:43,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:43,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:09:43,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:09:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:09:43,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:09:43,430 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 11:09:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:43,486 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:09:43,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:09:43,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 11:09:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:43,487 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:09:43,487 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:09:43,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:09:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:09:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:09:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:09:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:09:43,490 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:09:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:43,491 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:09:43,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:09:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:09:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:09:43,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:43,492 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2019-08-05 11:09:43,492 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1326204123, now seen corresponding path program 6 times [2019-08-05 11:09:43,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:43,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:09:43,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:43,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:43,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:43,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:43,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:43,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:43,790 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-05 11:09:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:43,985 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:09:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:43,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 11:09:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:43,986 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:09:43,987 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:09:43,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:09:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:09:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:09:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:09:43,990 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:09:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:43,991 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:09:43,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:09:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:09:43,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:43,992 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2019-08-05 11:09:43,992 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1123152682, now seen corresponding path program 7 times [2019-08-05 11:09:43,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:44,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:09:44,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:09:44,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:09:44,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:09:44,202 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-05 11:09:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,274 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:09:44,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:09:44,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 11:09:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,276 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:09:44,276 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:09:44,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:09:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:09:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:09:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:09:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:09:44,280 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:09:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,281 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:09:44,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:09:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:09:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:09:44,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,282 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2019-08-05 11:09:44,282 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1312964079, now seen corresponding path program 8 times [2019-08-05 11:09:44,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:44,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:44,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:44,531 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-08-05 11:09:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,584 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:09:44,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:44,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 11:09:44,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,587 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:09:44,587 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:09:44,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:09:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:09:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:09:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:09:44,591 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:09:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,591 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:09:44,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:09:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:09:44,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,597 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1] [2019-08-05 11:09:44,598 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,598 INFO L82 PathProgramCache]: Analyzing trace with hash -961877132, now seen corresponding path program 9 times [2019-08-05 11:09:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:44,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:09:44,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:09:44,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:09:44,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:44,879 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-08-05 11:09:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,945 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:09:44,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:09:44,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 11:09:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,952 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:09:44,952 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:09:44,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:09:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:09:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:09:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:09:44,956 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:09:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,956 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:09:44,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:09:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:09:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:09:44,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,957 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1] [2019-08-05 11:09:44,957 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,957 INFO L82 PathProgramCache]: Analyzing trace with hash -945927239, now seen corresponding path program 10 times [2019-08-05 11:09:44,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:45,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,150 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2019-08-05 11:09:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,213 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:09:45,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:45,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 11:09:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,215 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:09:45,215 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:09:45,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:09:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:09:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:09:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:09:45,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:09:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,219 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:09:45,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:09:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:09:45,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,220 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1] [2019-08-05 11:09:45,220 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1497018046, now seen corresponding path program 11 times [2019-08-05 11:09:45,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:45,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:09:45,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:09:45,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:09:45,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:45,399 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-08-05 11:09:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,461 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:09:45,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:09:45,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 11:09:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,462 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:09:45,462 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:09:45,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:09:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:09:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:09:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:09:45,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 11:09:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,466 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:09:45,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:09:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:09:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:09:45,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,467 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1] [2019-08-05 11:09:45,467 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash -179673981, now seen corresponding path program 12 times [2019-08-05 11:09:45,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:45,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:45,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:45,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:45,751 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2019-08-05 11:09:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,831 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:09:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:45,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 11:09:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,833 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:09:45,833 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:09:45,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:09:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:09:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:09:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:09:45,845 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 11:09:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,846 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:09:45,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:09:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:09:45,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,847 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1] [2019-08-05 11:09:45,847 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,847 INFO L82 PathProgramCache]: Analyzing trace with hash -867975928, now seen corresponding path program 13 times [2019-08-05 11:09:45,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:46,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:46,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:09:46,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:09:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:09:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:46,309 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2019-08-05 11:09:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,486 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:09:46,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:09:46,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 11:09:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,487 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:09:46,488 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:09:46,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:09:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:09:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:09:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:09:46,497 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:09:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,498 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:09:46,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:09:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:09:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:09:46,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,499 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1] [2019-08-05 11:09:46,499 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash -901183411, now seen corresponding path program 14 times [2019-08-05 11:09:46,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:47,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:47,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:09:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:09:47,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:47,185 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2019-08-05 11:09:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,502 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:09:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:09:47,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 11:09:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,503 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:09:47,504 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:09:47,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:09:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:09:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:09:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:09:47,508 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 11:09:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,508 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:09:47,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:09:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:09:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:47,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,509 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1] [2019-08-05 11:09:47,510 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1546163794, now seen corresponding path program 15 times [2019-08-05 11:09:47,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:47,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:09:47,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:47,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:47,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:47,742 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2019-08-05 11:09:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,912 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:09:47,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:47,913 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 11:09:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,914 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:09:47,914 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:09:47,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:09:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:09:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:09:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:09:47,919 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 11:09:47,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,919 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:09:47,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:09:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:09:47,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,920 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1] [2019-08-05 11:09:47,921 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash -195250409, now seen corresponding path program 16 times [2019-08-05 11:09:47,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:48,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:09:48,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:48,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:48,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:48,506 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2019-08-05 11:09:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,583 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:09:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:48,583 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 11:09:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,584 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:09:48,584 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:09:48,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:09:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:09:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:09:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:09:48,589 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 11:09:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,589 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:09:48,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:09:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:09:48,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,591 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1] [2019-08-05 11:09:48,591 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1342945948, now seen corresponding path program 17 times [2019-08-05 11:09:48,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:48,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:09:48,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:09:48,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:09:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:48,857 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2019-08-05 11:09:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,918 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:09:48,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:09:48,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 11:09:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,919 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:09:48,919 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:09:48,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:09:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:09:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:09:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:09:48,923 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 11:09:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,923 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:09:48,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:09:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:09:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:09:48,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,925 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1] [2019-08-05 11:09:48,925 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2080895201, now seen corresponding path program 18 times [2019-08-05 11:09:48,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:49,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:49,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:49,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:09:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:09:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:49,452 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2019-08-05 11:09:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:49,564 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:09:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:49,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 11:09:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:49,565 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:09:49,565 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:09:49,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:09:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:09:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:09:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:09:49,569 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 11:09:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:49,569 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:09:49,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:09:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:09:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:09:49,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:49,570 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1] [2019-08-05 11:09:49,570 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1714443802, now seen corresponding path program 19 times [2019-08-05 11:09:49,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:49,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:09:49,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:49,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:49,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:09:49,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:09:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:09:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:09:49,948 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2019-08-05 11:09:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:50,008 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:09:50,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:09:50,009 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 11:09:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:50,010 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:09:50,010 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:09:50,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:09:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:09:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:09:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:09:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:09:50,015 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 11:09:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:50,015 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:09:50,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:09:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:09:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:09:50,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:50,016 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1] [2019-08-05 11:09:50,016 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:50,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1686975915, now seen corresponding path program 20 times [2019-08-05 11:09:50,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:50,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:09:50,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:50,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:50,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:09:50,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:09:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:09:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:50,377 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2019-08-05 11:09:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:50,468 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:09:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:09:50,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 11:09:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:50,471 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:09:50,471 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:09:50,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:09:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:09:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:09:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:09:50,475 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 11:09:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:50,476 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:09:50,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:09:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:09:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:50,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:50,477 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1] [2019-08-05 11:09:50,477 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:50,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1981211696, now seen corresponding path program 21 times [2019-08-05 11:09:50,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:50,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:09:50,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:51,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:09:51,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:09:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:09:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:09:51,063 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2019-08-05 11:09:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:51,343 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:09:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:09:51,344 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 11:09:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:51,344 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:09:51,345 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:09:51,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:09:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:09:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:09:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:09:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:09:51,348 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 11:09:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:51,348 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:09:51,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:09:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:09:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:51,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:51,349 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1] [2019-08-05 11:09:51,350 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1273955701, now seen corresponding path program 22 times [2019-08-05 11:09:51,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:51,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:09:51,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:51,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:51,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:09:51,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:09:51,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:09:51,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:09:51,778 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2019-08-05 11:09:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:51,851 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:09:51,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:09:51,852 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 11:09:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:51,852 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:09:51,853 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:09:51,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:09:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:09:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:09:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:09:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:09:51,856 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 11:09:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:51,857 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:09:51,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:09:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:09:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:09:51,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:51,858 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1] [2019-08-05 11:09:51,858 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:51,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:51,858 INFO L82 PathProgramCache]: Analyzing trace with hash 205777274, now seen corresponding path program 23 times [2019-08-05 11:09:51,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:51,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:09:51,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:52,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:52,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:09:52,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:09:52,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:09:52,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:52,277 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2019-08-05 11:09:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:52,352 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:09:52,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:09:52,353 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 11:09:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:52,354 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:09:52,354 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:09:52,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:09:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:09:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:09:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:09:52,358 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 11:09:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:52,359 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:09:52,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:09:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:09:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:09:52,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:52,360 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1] [2019-08-05 11:09:52,360 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:52,360 INFO L82 PathProgramCache]: Analyzing trace with hash 183492671, now seen corresponding path program 24 times [2019-08-05 11:09:52,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:52,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:09:52,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:53,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:53,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:09:53,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:09:53,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:09:53,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:09:53,127 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2019-08-05 11:09:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:53,204 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:09:53,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:09:53,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 11:09:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:53,206 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:09:53,206 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:09:53,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:09:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:09:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:09:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:09:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:09:53,210 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 11:09:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:53,210 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:09:53,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:09:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:09:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:53,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:53,211 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1] [2019-08-05 11:09:53,212 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash 242825668, now seen corresponding path program 25 times [2019-08-05 11:09:53,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:53,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:09:53,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:54,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:54,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:09:54,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:09:54,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:09:54,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:09:54,047 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2019-08-05 11:09:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:54,137 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:09:54,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:09:54,138 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 11:09:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:54,139 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:09:54,139 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:09:54,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:09:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:09:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:09:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:09:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:09:54,143 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 11:09:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:54,144 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:09:54,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:09:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:09:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:09:54,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:54,145 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1] [2019-08-05 11:09:54,145 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:54,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1427260937, now seen corresponding path program 26 times [2019-08-05 11:09:54,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:54,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:09:54,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:55,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:55,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:09:55,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:09:55,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:09:55,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:09:55,132 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2019-08-05 11:09:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,214 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:09:55,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:09:55,214 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 11:09:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,215 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:09:55,215 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:09:55,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:09:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:09:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:09:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:09:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:09:55,219 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 11:09:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,219 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:09:55,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:09:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:09:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:09:55,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,220 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1] [2019-08-05 11:09:55,220 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1503221006, now seen corresponding path program 27 times [2019-08-05 11:09:55,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:55,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:55,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:09:55,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:09:55,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:09:55,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:09:55,977 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2019-08-05 11:09:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:56,083 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:09:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:09:56,084 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 11:09:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:56,085 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:09:56,085 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:09:56,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:09:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:09:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:09:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:09:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:09:56,089 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 11:09:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:56,089 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:09:56,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:09:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:09:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:09:56,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:56,090 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1] [2019-08-05 11:09:56,090 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:56,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:56,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1486403283, now seen corresponding path program 28 times [2019-08-05 11:09:56,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:56,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:09:56,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:58,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:58,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:09:58,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:09:58,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:09:58,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:09:58,107 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2019-08-05 11:09:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,239 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:09:58,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:09:58,240 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 11:09:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,241 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:09:58,241 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:09:58,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:09:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:09:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:09:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:09:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:09:58,245 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 11:09:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,245 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:09:58,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:09:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:09:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:58,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,246 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1] [2019-08-05 11:09:58,246 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1790526632, now seen corresponding path program 29 times [2019-08-05 11:09:58,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:58,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:09:58,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:09:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:09:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:09:58,840 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2019-08-05 11:09:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,948 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:09:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:09:58,954 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 11:09:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,955 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:09:58,955 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:09:58,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:09:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:09:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:09:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:09:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:09:58,958 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 11:09:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,958 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:09:58,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:09:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:09:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:09:58,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,959 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1] [2019-08-05 11:09:58,959 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1585820317, now seen corresponding path program 30 times [2019-08-05 11:09:58,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:59,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:59,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:09:59,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:09:59,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:09:59,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:09:59,634 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2019-08-05 11:09:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:59,769 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:09:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:09:59,770 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 11:09:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:59,771 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:09:59,771 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:09:59,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:09:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:09:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:09:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:09:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:09:59,775 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 11:09:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:59,775 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:09:59,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:09:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:09:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:09:59,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:59,776 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1] [2019-08-05 11:09:59,776 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash -740037470, now seen corresponding path program 31 times [2019-08-05 11:09:59,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:59,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:09:59,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:00,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:00,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:10:00,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:10:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:10:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:10:00,437 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2019-08-05 11:10:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:00,531 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:10:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:10:00,532 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 11:10:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:00,533 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:10:00,533 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:10:00,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:10:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:10:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:10:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:10:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:10:00,537 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 11:10:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:00,538 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:10:00,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:10:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:10:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:10:00,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:00,538 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1] [2019-08-05 11:10:00,539 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1788590439, now seen corresponding path program 32 times [2019-08-05 11:10:00,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:00,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:10:00,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:01,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:01,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:10:01,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:10:01,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:10:01,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:01,152 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2019-08-05 11:10:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,294 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:10:01,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:10:01,295 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 11:10:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,296 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:10:01,296 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:10:01,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:10:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:10:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:10:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:10:01,299 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 11:10:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,299 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:10:01,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:10:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:10:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:01,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,300 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1] [2019-08-05 11:10:01,300 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:01,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:01,301 INFO L82 PathProgramCache]: Analyzing trace with hash 848521452, now seen corresponding path program 33 times [2019-08-05 11:10:01,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:01,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:10:01,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:02,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:10:02,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:10:02,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:10:02,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:02,139 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2019-08-05 11:10:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,249 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:10:02,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:10:02,250 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 11:10:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,251 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:10:02,251 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:10:02,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:10:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:10:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:10:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:10:02,255 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 11:10:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,255 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:10:02,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:10:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:10:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:10:02,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,256 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1] [2019-08-05 11:10:02,256 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash -614642895, now seen corresponding path program 34 times [2019-08-05 11:10:02,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:03,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:10:03,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:10:03,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:10:03,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:10:03,087 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2019-08-05 11:10:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,229 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:10:03,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:10:03,229 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 11:10:03,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,230 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:10:03,231 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:10:03,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:10:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:10:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:10:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:10:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:10:03,234 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 11:10:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,234 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:10:03,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:10:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:10:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:10:03,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,235 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1] [2019-08-05 11:10:03,235 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2033692726, now seen corresponding path program 35 times [2019-08-05 11:10:03,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:04,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:04,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:10:04,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:10:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:10:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:04,115 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2019-08-05 11:10:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:04,218 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:10:04,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:10:04,218 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 11:10:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:04,219 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:10:04,220 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:10:04,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:10:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:10:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:10:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:10:04,223 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 11:10:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:04,223 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:10:04,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:10:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:10:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:10:04,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:04,224 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1] [2019-08-05 11:10:04,224 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash 168617979, now seen corresponding path program 36 times [2019-08-05 11:10:04,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:04,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:10:04,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:04,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:04,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:10:04,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:10:04,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:10:04,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:04,992 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2019-08-05 11:10:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,101 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:10:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:10:05,102 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 11:10:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,103 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:10:05,103 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:10:05,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:10:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:10:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:10:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:10:05,107 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 11:10:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,107 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:10:05,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:10:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:10:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:05,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,108 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1] [2019-08-05 11:10:05,108 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1166851456, now seen corresponding path program 37 times [2019-08-05 11:10:05,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:06,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:10:06,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:10:06,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:10:06,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:10:06,908 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2019-08-05 11:10:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,021 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:10:07,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:10:07,021 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 11:10:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,022 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:10:07,022 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:10:07,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:10:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:10:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:10:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:10:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:10:07,026 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 11:10:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,026 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:10:07,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:10:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:10:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:10:07,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,027 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1] [2019-08-05 11:10:07,027 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -357756987, now seen corresponding path program 38 times [2019-08-05 11:10:07,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:08,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:08,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:10:08,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:10:08,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:10:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:10:08,056 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2019-08-05 11:10:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,202 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:10:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:10:08,202 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 11:10:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,203 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:10:08,203 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:10:08,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:10:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:10:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:10:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:10:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:10:08,207 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 11:10:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,208 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:10:08,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:10:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:10:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:10:08,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,208 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1] [2019-08-05 11:10:08,209 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,209 INFO L82 PathProgramCache]: Analyzing trace with hash -207052854, now seen corresponding path program 39 times [2019-08-05 11:10:08,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:09,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:09,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:10:09,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:10:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:10:09,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:10:09,069 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2019-08-05 11:10:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:09,235 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:10:09,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:10:09,236 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 11:10:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:09,237 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:10:09,237 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:10:09,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:10:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:10:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:10:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:10:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:10:09,241 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 11:10:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:09,241 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:10:09,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:10:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:10:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:10:09,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:09,242 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1] [2019-08-05 11:10:09,242 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:09,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1409269105, now seen corresponding path program 40 times [2019-08-05 11:10:09,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:09,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:10:09,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:10,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:10:10,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:10:10,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:10:10,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:10:10,251 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2019-08-05 11:10:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,393 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:10:10,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:10:10,393 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 11:10:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,394 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:10:10,394 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:10:10,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:10:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:10:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:10:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:10:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:10:10,398 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 11:10:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,399 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:10:10,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:10:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:10:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:10,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,399 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1] [2019-08-05 11:10:10,400 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1392883692, now seen corresponding path program 41 times [2019-08-05 11:10:10,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:11,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:11,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:10:11,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:10:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:10:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:10:11,298 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2019-08-05 11:10:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:11,416 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:10:11,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:10:11,416 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 11:10:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:11,417 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:10:11,417 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:10:11,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:10:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:10:11,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:10:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:10:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:10:11,422 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 11:10:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:11,422 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:10:11,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:10:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:10:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:10:11,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:11,423 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1] [2019-08-05 11:10:11,423 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1468596313, now seen corresponding path program 42 times [2019-08-05 11:10:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:11,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:10:11,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:12,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:10:12,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:10:12,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:10:12,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:10:12,649 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2019-08-05 11:10:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,772 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:10:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:10:12,772 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 11:10:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,773 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:10:12,774 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:10:12,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:10:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:10:12,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:10:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:10:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:10:12,777 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 11:10:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,777 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:10:12,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:10:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:10:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:10:12,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,778 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1] [2019-08-05 11:10:12,778 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1723155618, now seen corresponding path program 43 times [2019-08-05 11:10:12,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:13,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:13,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:10:13,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:10:13,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:10:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:10:13,775 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2019-08-05 11:10:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:13,906 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:10:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:10:13,906 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 11:10:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:13,907 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:10:13,907 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:10:13,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:10:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:10:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:10:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:10:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:10:13,911 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 11:10:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:13,911 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:10:13,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:10:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:10:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:10:13,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:13,912 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1] [2019-08-05 11:10:13,912 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:13,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1904855331, now seen corresponding path program 44 times [2019-08-05 11:10:13,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:13,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:10:13,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:14,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:10:14,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:10:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:10:14,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:10:14,926 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2019-08-05 11:10:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,309 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:10:15,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:10:15,310 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 11:10:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,311 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:10:15,311 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:10:15,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:10:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:10:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:10:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:10:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:10:15,314 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 11:10:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,315 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:10:15,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:10:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:10:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:10:15,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,315 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1] [2019-08-05 11:10:15,315 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 909932968, now seen corresponding path program 45 times [2019-08-05 11:10:15,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:16,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:10:16,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:10:16,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:10:16,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:10:16,465 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2019-08-05 11:10:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:16,603 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:10:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:10:16,604 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 11:10:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:16,605 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:10:16,605 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:10:16,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:10:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:10:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:10:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:10:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:10:16,608 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 11:10:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:16,609 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:10:16,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:10:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:10:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:10:16,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:16,610 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1] [2019-08-05 11:10:16,610 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1727718163, now seen corresponding path program 46 times [2019-08-05 11:10:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:16,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:10:16,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:18,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:18,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:10:18,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:10:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:10:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:10:18,011 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2019-08-05 11:10:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:18,145 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:10:18,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:10:18,145 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 11:10:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:18,146 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:10:18,146 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:10:18,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:10:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:10:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:10:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:10:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:10:18,150 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 11:10:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:18,150 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:10:18,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:10:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:10:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:10:18,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:18,151 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1] [2019-08-05 11:10:18,151 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1815216882, now seen corresponding path program 47 times [2019-08-05 11:10:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:18,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:10:18,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:19,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:19,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:10:19,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:10:19,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:10:19,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:10:19,419 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2019-08-05 11:10:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,570 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:10:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:10:19,571 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 11:10:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,572 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:10:19,572 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:10:19,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:10:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:10:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:10:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:10:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:10:19,576 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 11:10:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,576 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:10:19,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:10:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:10:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:10:19,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,577 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1] [2019-08-05 11:10:19,577 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash 666729399, now seen corresponding path program 48 times [2019-08-05 11:10:19,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:20,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:20,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:10:20,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:10:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:10:20,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:10:20,903 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2019-08-05 11:10:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,050 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:10:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:10:21,051 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 11:10:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,052 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:10:21,052 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:10:21,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:10:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:10:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:10:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:10:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:10:21,056 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 11:10:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,057 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:10:21,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:10:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:10:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:10:21,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,058 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1] [2019-08-05 11:10:21,058 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash 776853308, now seen corresponding path program 49 times [2019-08-05 11:10:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:22,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:10:22,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:10:22,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:10:22,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:10:22,773 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2019-08-05 11:10:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,931 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:10:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:10:22,932 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 11:10:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,933 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:10:22,933 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:10:22,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:10:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:10:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:10:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:10:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:10:22,937 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 11:10:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,937 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:10:22,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:10:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:10:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:10:22,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,938 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1] [2019-08-05 11:10:22,938 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash -768252543, now seen corresponding path program 50 times [2019-08-05 11:10:22,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:24,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:24,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:10:24,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:10:24,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:10:24,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:10:24,231 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2019-08-05 11:10:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,115 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:10:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:10:25,116 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 11:10:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,117 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:10:25,117 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:10:25,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:10:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:10:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:10:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:10:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:10:25,121 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 11:10:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,122 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:10:25,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:10:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:10:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:10:25,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,123 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1] [2019-08-05 11:10:25,123 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,123 INFO L82 PathProgramCache]: Analyzing trace with hash 443709062, now seen corresponding path program 51 times [2019-08-05 11:10:25,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:26,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:10:26,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:10:26,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:10:26,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:10:26,461 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2019-08-05 11:10:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,611 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:10:26,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:10:26,611 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 11:10:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,613 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:10:26,613 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:10:26,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:10:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:10:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:10:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:10:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:10:26,617 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 11:10:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,617 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:10:26,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:10:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:10:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:10:26,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,618 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1] [2019-08-05 11:10:26,619 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1202674251, now seen corresponding path program 52 times [2019-08-05 11:10:26,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:28,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:10:28,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:10:28,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:10:28,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:10:28,642 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2019-08-05 11:10:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,819 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:10:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:10:28,819 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 11:10:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,820 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:10:28,821 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:10:28,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:10:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:10:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:10:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:10:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:10:28,824 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 11:10:28,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,825 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:10:28,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:10:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:10:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:10:28,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,826 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1] [2019-08-05 11:10:28,826 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,826 INFO L82 PathProgramCache]: Analyzing trace with hash 423780560, now seen corresponding path program 53 times [2019-08-05 11:10:28,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:30,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:10:30,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:10:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:10:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:10:30,197 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2019-08-05 11:10:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,358 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:10:30,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:10:30,358 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 11:10:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,359 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:10:30,360 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:10:30,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:10:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:10:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:10:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:10:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:10:30,362 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 11:10:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,362 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:10:30,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:10:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:10:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:10:30,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,363 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1] [2019-08-05 11:10:30,363 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash -768746987, now seen corresponding path program 54 times [2019-08-05 11:10:30,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:32,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:32,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:10:32,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:10:32,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:10:32,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:10:32,002 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2019-08-05 11:10:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,253 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:10:32,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:10:32,254 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 11:10:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,255 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:10:32,255 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:10:32,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:10:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:10:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:10:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:10:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:10:32,259 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 11:10:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,260 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:10:32,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:10:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:10:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:10:32,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,260 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1] [2019-08-05 11:10:32,261 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,261 INFO L82 PathProgramCache]: Analyzing trace with hash -31451622, now seen corresponding path program 55 times [2019-08-05 11:10:32,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:33,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:10:33,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:10:33,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:10:33,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:10:33,695 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2019-08-05 11:10:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,855 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:10:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:10:33,856 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 11:10:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,857 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:10:33,857 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:10:33,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:10:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:10:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:10:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:10:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:10:33,860 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 11:10:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,860 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:10:33,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:10:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:10:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:10:33,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,861 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1] [2019-08-05 11:10:33,861 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,861 INFO L82 PathProgramCache]: Analyzing trace with hash -160209697, now seen corresponding path program 56 times [2019-08-05 11:10:33,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:35,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:10:35,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:10:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:10:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:10:35,403 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2019-08-05 11:10:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:35,567 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:10:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:10:35,567 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 11:10:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:35,569 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:10:35,569 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:10:35,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:10:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:10:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:10:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:10:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:10:35,571 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 11:10:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:35,572 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:10:35,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:10:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:10:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:10:35,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:35,573 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1] [2019-08-05 11:10:35,573 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash 657331812, now seen corresponding path program 57 times [2019-08-05 11:10:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:35,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:10:35,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:38,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:10:38,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:10:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:10:38,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:10:38,204 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2019-08-05 11:10:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,375 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:10:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:10:38,375 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 11:10:38,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,376 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:38,376 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:10:38,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:10:38,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:10:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:10:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:10:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:10:38,380 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 11:10:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,380 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:10:38,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:10:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:10:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:10:38,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,381 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1] [2019-08-05 11:10:38,381 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,382 INFO L82 PathProgramCache]: Analyzing trace with hash 335706793, now seen corresponding path program 58 times [2019-08-05 11:10:38,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:40,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:10:40,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:10:40,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:10:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:10:40,191 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2019-08-05 11:10:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:40,360 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:10:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:10:40,361 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 11:10:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:40,361 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:10:40,362 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:10:40,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:10:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:10:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:10:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:10:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:10:40,365 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 11:10:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:40,365 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:10:40,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:10:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:10:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:10:40,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:40,367 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1] [2019-08-05 11:10:40,367 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:40,368 INFO L82 PathProgramCache]: Analyzing trace with hash 491708846, now seen corresponding path program 59 times [2019-08-05 11:10:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:40,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:10:40,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:42,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:42,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:10:42,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:10:42,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:10:42,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:10:42,037 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2019-08-05 11:10:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:42,224 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 11:10:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:10:42,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 11:10:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:42,225 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:10:42,225 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:10:42,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:10:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:10:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 11:10:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:10:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 11:10:42,229 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 11:10:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:42,229 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 11:10:42,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:10:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 11:10:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 11:10:42,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:42,230 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1] [2019-08-05 11:10:42,230 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 85826419, now seen corresponding path program 60 times [2019-08-05 11:10:42,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:42,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:10:42,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:44,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:44,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:10:44,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:10:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:10:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:10:44,339 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2019-08-05 11:10:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:44,533 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 11:10:44,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:10:44,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 11:10:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,535 INFO L225 Difference]: With dead ends: 127 [2019-08-05 11:10:44,535 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 11:10:44,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:10:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 11:10:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-08-05 11:10:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 11:10:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 11:10:44,539 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 11:10:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,539 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 11:10:44,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:10:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 11:10:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 11:10:44,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,540 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1] [2019-08-05 11:10:44,540 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:44,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,541 INFO L82 PathProgramCache]: Analyzing trace with hash 874838008, now seen corresponding path program 61 times [2019-08-05 11:10:44,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:46,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:10:46,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:10:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:10:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:10:46,339 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2019-08-05 11:10:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:46,551 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 11:10:46,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:10:46,551 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 11:10:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:46,552 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:10:46,553 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 11:10:46,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:10:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 11:10:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-05 11:10:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 11:10:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 11:10:46,555 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 11:10:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:46,556 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 11:10:46,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:10:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 11:10:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 11:10:46,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:46,556 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1] [2019-08-05 11:10:46,557 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:46,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1094236355, now seen corresponding path program 62 times [2019-08-05 11:10:46,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:46,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:10:46,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:48,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:10:48,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:10:48,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:10:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:10:48,675 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2019-08-05 11:10:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,892 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 11:10:48,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:10:48,892 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 11:10:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,893 INFO L225 Difference]: With dead ends: 131 [2019-08-05 11:10:48,893 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:10:48,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:10:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:10:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-08-05 11:10:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 11:10:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 11:10:48,897 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 11:10:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,897 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 11:10:48,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:10:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 11:10:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 11:10:48,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,899 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1] [2019-08-05 11:10:48,899 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,899 INFO L82 PathProgramCache]: Analyzing trace with hash 705878338, now seen corresponding path program 63 times [2019-08-05 11:10:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:50,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:10:50,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:10:50,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:10:50,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:10:50,761 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2019-08-05 11:10:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,032 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 11:10:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:10:51,032 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 11:10:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,033 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:10:51,034 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 11:10:51,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:10:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 11:10:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 11:10:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 11:10:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 11:10:51,037 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 11:10:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,037 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 11:10:51,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:10:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 11:10:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 11:10:51,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,038 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1] [2019-08-05 11:10:51,038 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -255721977, now seen corresponding path program 64 times [2019-08-05 11:10:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:53,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:10:53,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:10:53,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:10:53,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:10:53,279 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2019-08-05 11:10:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,476 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 11:10:53,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:10:53,476 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 11:10:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,477 INFO L225 Difference]: With dead ends: 135 [2019-08-05 11:10:53,478 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 11:10:53,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:10:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 11:10:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-05 11:10:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:10:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 11:10:53,481 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 11:10:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,481 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 11:10:53,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:10:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 11:10:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:10:53,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,482 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1] [2019-08-05 11:10:53,482 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash -935656052, now seen corresponding path program 65 times [2019-08-05 11:10:53,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:55,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:10:55,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:10:55,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:10:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:10:55,461 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2019-08-05 11:10:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:55,660 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 11:10:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:10:55,661 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 11:10:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:55,662 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:55,662 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:10:55,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:10:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:10:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 11:10:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:10:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 11:10:55,666 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 11:10:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:55,666 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 11:10:55,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:10:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 11:10:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:10:55,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:55,667 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1] [2019-08-05 11:10:55,667 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1517273135, now seen corresponding path program 66 times [2019-08-05 11:10:55,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:55,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:10:55,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:10:58,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:10:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:10:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:10:58,105 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2019-08-05 11:10:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,495 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 11:10:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:10:58,496 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 11:10:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,497 INFO L225 Difference]: With dead ends: 139 [2019-08-05 11:10:58,497 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 11:10:58,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:10:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 11:10:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-08-05 11:10:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:10:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 11:10:58,501 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 11:10:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,501 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 11:10:58,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:10:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 11:10:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 11:10:58,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,502 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1] [2019-08-05 11:10:58,503 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:58,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2105541418, now seen corresponding path program 67 times [2019-08-05 11:10:58,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:01,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:11:01,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:11:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:11:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:11:01,989 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2019-08-05 11:11:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:02,446 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 11:11:02,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:11:02,446 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 11:11:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:02,447 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:11:02,448 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 11:11:02,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:11:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 11:11:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 11:11:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 11:11:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 11:11:02,451 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 11:11:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:02,451 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 11:11:02,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:11:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 11:11:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 11:11:02,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:02,452 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1] [2019-08-05 11:11:02,453 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash -495678309, now seen corresponding path program 68 times [2019-08-05 11:11:02,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:02,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:11:02,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:04,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:04,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:11:04,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:11:04,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:11:04,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:11:04,834 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2019-08-05 11:11:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,104 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 11:11:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:11:05,104 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 11:11:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,105 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:11:05,105 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 11:11:05,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:11:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 11:11:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-08-05 11:11:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:11:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 11:11:05,108 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 11:11:05,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,108 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 11:11:05,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:11:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 11:11:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 11:11:05,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,109 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1] [2019-08-05 11:11:05,109 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,109 INFO L82 PathProgramCache]: Analyzing trace with hash 394542880, now seen corresponding path program 69 times [2019-08-05 11:11:05,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:07,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:11:07,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:11:07,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:11:07,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:11:07,299 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2019-08-05 11:11:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:07,508 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-05 11:11:07,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:11:07,508 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 11:11:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:07,509 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:11:07,509 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 11:11:07,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:11:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 11:11:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-08-05 11:11:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 11:11:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 11:11:07,515 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 11:11:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:07,515 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 11:11:07,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:11:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 11:11:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 11:11:07,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:07,516 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1] [2019-08-05 11:11:07,516 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1198613605, now seen corresponding path program 70 times [2019-08-05 11:11:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:07,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:11:07,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:10,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:11:10,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:11:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:11:10,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:11:10,145 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2019-08-05 11:11:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,365 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 11:11:10,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:11:10,366 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 11:11:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,367 INFO L225 Difference]: With dead ends: 147 [2019-08-05 11:11:10,367 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 11:11:10,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:11:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 11:11:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-05 11:11:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 11:11:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 11:11:10,371 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 11:11:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,372 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 11:11:10,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:11:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 11:11:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 11:11:10,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,373 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1] [2019-08-05 11:11:10,373 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash 816467050, now seen corresponding path program 71 times [2019-08-05 11:11:10,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:12,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:12,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:11:12,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:11:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:11:12,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:11:12,702 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2019-08-05 11:11:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,977 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 11:11:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:11:12,978 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 11:11:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,979 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:11:12,979 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 11:11:12,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:11:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 11:11:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 11:11:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 11:11:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 11:11:12,982 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 11:11:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,983 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 11:11:12,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:11:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 11:11:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 11:11:12,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,984 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1] [2019-08-05 11:11:12,984 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1354152145, now seen corresponding path program 72 times [2019-08-05 11:11:12,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:13,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:11:13,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:15,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:11:15,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:11:15,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:11:15,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:11:15,480 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2019-08-05 11:11:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:15,721 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-08-05 11:11:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:11:15,722 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 11:11:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:15,723 INFO L225 Difference]: With dead ends: 151 [2019-08-05 11:11:15,723 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 11:11:15,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:11:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 11:11:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-08-05 11:11:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 11:11:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 11:11:15,727 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 11:11:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,728 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 11:11:15,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:11:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 11:11:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 11:11:15,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,729 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1] [2019-08-05 11:11:15,729 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 34907316, now seen corresponding path program 73 times [2019-08-05 11:11:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:18,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:18,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:11:18,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:11:18,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:11:18,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:11:18,411 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2019-08-05 11:11:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:18,727 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-05 11:11:18,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:11:18,728 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 11:11:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:18,728 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:11:18,728 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 11:11:18,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:11:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 11:11:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-05 11:11:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 11:11:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 11:11:18,732 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 11:11:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:18,732 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 11:11:18,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:11:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 11:11:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 11:11:18,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:18,734 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1] [2019-08-05 11:11:18,734 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:18,734 INFO L82 PathProgramCache]: Analyzing trace with hash -813779719, now seen corresponding path program 74 times [2019-08-05 11:11:18,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:18,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:11:18,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:21,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:11:21,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:11:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:11:21,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:11:21,677 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2019-08-05 11:11:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:21,901 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-05 11:11:21,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:11:21,902 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 11:11:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:21,903 INFO L225 Difference]: With dead ends: 155 [2019-08-05 11:11:21,903 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 11:11:21,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:11:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 11:11:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-08-05 11:11:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 11:11:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 11:11:21,906 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 11:11:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:21,906 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 11:11:21,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:11:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 11:11:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 11:11:21,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:21,907 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1] [2019-08-05 11:11:21,907 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:21,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash -358234114, now seen corresponding path program 75 times [2019-08-05 11:11:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:21,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:11:21,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:24,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:11:24,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:11:24,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:11:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:11:24,790 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2019-08-05 11:11:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:25,030 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-05 11:11:25,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:11:25,031 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 11:11:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:25,032 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:11:25,032 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 11:11:25,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:11:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 11:11:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-08-05 11:11:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 11:11:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 11:11:25,036 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 11:11:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:25,036 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 11:11:25,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:11:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 11:11:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 11:11:25,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,037 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1] [2019-08-05 11:11:25,038 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash -665571901, now seen corresponding path program 76 times [2019-08-05 11:11:25,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:28,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:11:28,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:11:28,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:11:28,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:11:28,161 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2019-08-05 11:11:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:28,428 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-05 11:11:28,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:11:28,428 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 11:11:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:28,429 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:11:28,429 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 11:11:28,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:11:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 11:11:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-05 11:11:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 11:11:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 11:11:28,431 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 11:11:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:28,431 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 11:11:28,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:11:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 11:11:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:11:28,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:28,432 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1] [2019-08-05 11:11:28,432 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash 335558216, now seen corresponding path program 77 times [2019-08-05 11:11:28,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:28,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:11:28,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:31,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:31,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:11:31,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:11:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:11:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:11:31,296 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 80 states. [2019-08-05 11:11:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:31,542 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-05 11:11:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:11:31,543 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2019-08-05 11:11:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:31,544 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:11:31,544 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 11:11:31,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:11:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 11:11:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 11:11:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 11:11:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-08-05 11:11:31,548 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2019-08-05 11:11:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:31,548 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-08-05 11:11:31,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:11:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-08-05 11:11:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-08-05 11:11:31,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:31,549 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1] [2019-08-05 11:11:31,549 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:31,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:31,549 INFO L82 PathProgramCache]: Analyzing trace with hash 348926349, now seen corresponding path program 78 times [2019-08-05 11:11:31,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:31,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:11:31,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:34,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:34,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:11:34,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:11:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:11:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:11:34,800 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 81 states. [2019-08-05 11:11:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:35,036 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-08-05 11:11:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:11:35,036 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2019-08-05 11:11:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:35,038 INFO L225 Difference]: With dead ends: 163 [2019-08-05 11:11:35,038 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 11:11:35,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:11:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 11:11:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-08-05 11:11:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 11:11:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-08-05 11:11:35,041 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2019-08-05 11:11:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:35,042 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-08-05 11:11:35,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:11:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-08-05 11:11:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-08-05 11:11:35,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:35,043 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1] [2019-08-05 11:11:35,043 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash 310800274, now seen corresponding path program 79 times [2019-08-05 11:11:35,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:35,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:11:35,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:37,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:37,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:11:37,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:11:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:11:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:11:37,862 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 82 states. [2019-08-05 11:11:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:38,125 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-08-05 11:11:38,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:11:38,126 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2019-08-05 11:11:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:38,127 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:11:38,127 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 11:11:38,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:11:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 11:11:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 11:11:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 11:11:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 11:11:38,132 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2019-08-05 11:11:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:38,132 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 11:11:38,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:11:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 11:11:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:11:38,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:38,133 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1] [2019-08-05 11:11:38,134 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1968619433, now seen corresponding path program 80 times [2019-08-05 11:11:38,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:38,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:11:38,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:41,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:41,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:11:41,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:11:41,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:11:41,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:11:41,264 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 83 states. [2019-08-05 11:11:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:41,518 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-05 11:11:41,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:11:41,519 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2019-08-05 11:11:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:41,520 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:11:41,520 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 11:11:41,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:11:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 11:11:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 11:11:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:11:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-08-05 11:11:41,523 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2019-08-05 11:11:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:41,524 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-08-05 11:11:41,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:11:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-08-05 11:11:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:11:41,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:41,524 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1] [2019-08-05 11:11:41,525 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2057636900, now seen corresponding path program 81 times [2019-08-05 11:11:41,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:41,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:11:41,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:44,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:11:44,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:11:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:11:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:11:44,728 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 84 states. [2019-08-05 11:11:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:44,981 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-08-05 11:11:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:11:44,982 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2019-08-05 11:11:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:44,983 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:11:44,983 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 11:11:44,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:11:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 11:11:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-08-05 11:11:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 11:11:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-08-05 11:11:44,986 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2019-08-05 11:11:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:44,987 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2019-08-05 11:11:44,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:11:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2019-08-05 11:11:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:11:44,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:44,988 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1] [2019-08-05 11:11:44,988 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:44,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1704076767, now seen corresponding path program 82 times [2019-08-05 11:11:44,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:45,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:11:45,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:48,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:48,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:11:48,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:11:48,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:11:48,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:11:48,307 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 85 states. [2019-08-05 11:11:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,567 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-08-05 11:11:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:11:48,568 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2019-08-05 11:11:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,569 INFO L225 Difference]: With dead ends: 171 [2019-08-05 11:11:48,569 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 11:11:48,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:11:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 11:11:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-08-05 11:11:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-05 11:11:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-05 11:11:48,573 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2019-08-05 11:11:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,573 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-05 11:11:48,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:11:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-05 11:11:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 11:11:48,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,574 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1] [2019-08-05 11:11:48,574 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1235205338, now seen corresponding path program 83 times [2019-08-05 11:11:48,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:52,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:52,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:11:52,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:11:52,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:11:52,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:11:52,634 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 86 states. [2019-08-05 11:11:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:52,898 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-05 11:11:52,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:11:52,899 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-08-05 11:11:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:52,900 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:11:52,900 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 11:11:52,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:11:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 11:11:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-08-05 11:11:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 11:11:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-08-05 11:11:52,904 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2019-08-05 11:11:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:52,905 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-08-05 11:11:52,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:11:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-08-05 11:11:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-08-05 11:11:52,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:52,906 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1] [2019-08-05 11:11:52,906 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:52,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1621328149, now seen corresponding path program 84 times [2019-08-05 11:11:52,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:52,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:11:52,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:56,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:56,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:11:56,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:11:56,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:11:56,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:11:56,198 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 87 states. [2019-08-05 11:11:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:56,473 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-08-05 11:11:56,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:11:56,473 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2019-08-05 11:11:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:56,475 INFO L225 Difference]: With dead ends: 175 [2019-08-05 11:11:56,475 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 11:11:56,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:11:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 11:11:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-08-05 11:11:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-08-05 11:11:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-08-05 11:11:56,479 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2019-08-05 11:11:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:56,480 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2019-08-05 11:11:56,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:11:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2019-08-05 11:11:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-08-05 11:11:56,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:56,481 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1] [2019-08-05 11:11:56,481 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash 976805232, now seen corresponding path program 85 times [2019-08-05 11:11:56,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:56,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:11:56,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:59,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:59,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:11:59,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:11:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:11:59,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:11:59,976 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 88 states. [2019-08-05 11:12:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:00,249 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-08-05 11:12:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:12:00,250 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2019-08-05 11:12:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:00,251 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:12:00,251 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 11:12:00,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:12:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 11:12:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-05 11:12:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 11:12:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-05 11:12:00,255 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2019-08-05 11:12:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:00,256 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-05 11:12:00,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:12:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-05 11:12:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:12:00,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:00,257 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1] [2019-08-05 11:12:00,257 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:00,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1887981899, now seen corresponding path program 86 times [2019-08-05 11:12:00,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:00,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:12:00,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:03,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:03,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:12:03,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:12:03,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:12:03,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:12:03,477 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 89 states. [2019-08-05 11:12:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:03,784 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-05 11:12:03,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:12:03,784 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2019-08-05 11:12:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:03,786 INFO L225 Difference]: With dead ends: 179 [2019-08-05 11:12:03,786 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 11:12:03,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:12:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 11:12:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-08-05 11:12:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 11:12:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-08-05 11:12:03,789 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2019-08-05 11:12:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:03,789 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-08-05 11:12:03,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:12:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-08-05 11:12:03,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-08-05 11:12:03,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:03,790 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1] [2019-08-05 11:12:03,790 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:03,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:03,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1874378054, now seen corresponding path program 87 times [2019-08-05 11:12:03,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:03,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:12:03,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:07,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:12:07,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:12:07,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:12:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:12:07,456 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 90 states. [2019-08-05 11:12:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:07,756 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-08-05 11:12:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:12:07,757 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2019-08-05 11:12:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:07,758 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:12:07,758 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 11:12:07,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:12:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 11:12:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 11:12:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 11:12:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 11:12:07,762 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2019-08-05 11:12:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:07,762 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 11:12:07,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:12:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 11:12:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 11:12:07,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:07,763 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1] [2019-08-05 11:12:07,763 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:07,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1685984897, now seen corresponding path program 88 times [2019-08-05 11:12:07,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:07,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:12:07,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:11,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:11,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:12:11,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:12:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:12:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:12:11,554 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 91 states. [2019-08-05 11:12:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:11,850 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-08-05 11:12:11,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:12:11,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2019-08-05 11:12:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:11,852 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:12:11,852 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 11:12:11,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:12:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 11:12:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-05 11:12:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:12:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-05 11:12:11,856 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2019-08-05 11:12:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:11,856 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-05 11:12:11,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:12:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-05 11:12:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-05 11:12:11,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:11,857 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1] [2019-08-05 11:12:11,857 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1028787452, now seen corresponding path program 89 times [2019-08-05 11:12:11,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:11,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:12:11,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:15,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:15,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:12:15,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:12:15,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:12:15,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:12:15,567 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 92 states. [2019-08-05 11:12:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:15,895 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-08-05 11:12:15,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:12:15,895 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2019-08-05 11:12:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:15,896 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:12:15,897 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 11:12:15,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:12:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 11:12:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 11:12:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:12:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-08-05 11:12:15,900 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2019-08-05 11:12:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:15,900 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-08-05 11:12:15,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:12:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-08-05 11:12:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 11:12:15,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,901 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1] [2019-08-05 11:12:15,901 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash -822235319, now seen corresponding path program 90 times [2019-08-05 11:12:15,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:19,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:19,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:12:19,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:12:19,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:12:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:12:19,461 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 93 states. [2019-08-05 11:12:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:19,856 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-08-05 11:12:19,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:12:19,857 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2019-08-05 11:12:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:19,858 INFO L225 Difference]: With dead ends: 187 [2019-08-05 11:12:19,858 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 11:12:19,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:12:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 11:12:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-05 11:12:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:12:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-08-05 11:12:19,862 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2019-08-05 11:12:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:19,862 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-08-05 11:12:19,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:12:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-08-05 11:12:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-08-05 11:12:19,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:19,864 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1] [2019-08-05 11:12:19,864 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:19,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 105868878, now seen corresponding path program 91 times [2019-08-05 11:12:19,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:19,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:12:19,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:23,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:23,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:12:23,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:12:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:12:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:12:23,591 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 94 states. [2019-08-05 11:12:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:23,905 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-08-05 11:12:23,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:12:23,905 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2019-08-05 11:12:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:23,907 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:12:23,907 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 11:12:23,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:12:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 11:12:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 11:12:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 11:12:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-05 11:12:23,910 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2019-08-05 11:12:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:23,910 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-05 11:12:23,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:12:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-05 11:12:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-05 11:12:23,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:23,912 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1] [2019-08-05 11:12:23,912 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1339195373, now seen corresponding path program 92 times [2019-08-05 11:12:23,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:23,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:12:23,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:28,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:12:28,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:12:28,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:12:28,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:12:28,012 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 95 states. [2019-08-05 11:12:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,335 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-08-05 11:12:28,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:12:28,335 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2019-08-05 11:12:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,337 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:12:28,337 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 11:12:28,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:12:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 11:12:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-08-05 11:12:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 11:12:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-08-05 11:12:28,341 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2019-08-05 11:12:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,341 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-08-05 11:12:28,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:12:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-08-05 11:12:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-08-05 11:12:28,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,342 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1] [2019-08-05 11:12:28,342 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1523463320, now seen corresponding path program 93 times [2019-08-05 11:12:28,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:32,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:12:32,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:12:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:12:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:12:32,426 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 96 states. [2019-08-05 11:12:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,739 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-08-05 11:12:32,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:12:32,740 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2019-08-05 11:12:32,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,741 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:12:32,741 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 11:12:32,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:12:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 11:12:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-08-05 11:12:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 11:12:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-08-05 11:12:32,744 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2019-08-05 11:12:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,744 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-08-05 11:12:32,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:12:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-08-05 11:12:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-08-05 11:12:32,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,745 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1] [2019-08-05 11:12:32,745 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash -535569443, now seen corresponding path program 94 times [2019-08-05 11:12:32,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:36,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:12:36,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:12:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:12:36,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:12:36,994 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 97 states. [2019-08-05 11:12:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,304 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-08-05 11:12:37,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:12:37,305 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2019-08-05 11:12:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,306 INFO L225 Difference]: With dead ends: 195 [2019-08-05 11:12:37,306 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 11:12:37,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:12:37,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 11:12:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-05 11:12:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 11:12:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-05 11:12:37,310 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2019-08-05 11:12:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,310 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-05 11:12:37,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:12:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-05 11:12:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 11:12:37,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,311 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1] [2019-08-05 11:12:37,311 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,311 INFO L82 PathProgramCache]: Analyzing trace with hash 713868770, now seen corresponding path program 95 times [2019-08-05 11:12:37,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:41,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:12:41,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:12:41,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:12:41,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:12:41,498 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 98 states. [2019-08-05 11:12:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,802 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-08-05 11:12:41,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:12:41,803 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2019-08-05 11:12:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,804 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:12:41,804 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 11:12:41,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:12:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 11:12:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 11:12:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 11:12:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 11:12:41,807 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2019-08-05 11:12:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,808 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 11:12:41,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:12:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 11:12:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 11:12:41,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,809 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1] [2019-08-05 11:12:41,809 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1166851417, now seen corresponding path program 96 times [2019-08-05 11:12:41,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:46,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:12:46,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:12:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:12:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:12:46,130 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 99 states. [2019-08-05 11:12:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,464 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-08-05 11:12:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:12:46,465 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2019-08-05 11:12:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,466 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:12:46,466 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 11:12:46,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:12:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 11:12:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-08-05 11:12:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 11:12:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2019-08-05 11:12:46,470 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2019-08-05 11:12:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,470 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2019-08-05 11:12:46,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:12:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2019-08-05 11:12:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-08-05 11:12:46,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,472 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1] [2019-08-05 11:12:46,472 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash -357719508, now seen corresponding path program 97 times [2019-08-05 11:12:46,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:50,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:12:50,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:12:50,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:12:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:12:50,967 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 100 states. [2019-08-05 11:12:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,279 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-08-05 11:12:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:12:51,279 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2019-08-05 11:12:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,281 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:12:51,281 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 11:12:51,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:12:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 11:12:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 11:12:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:12:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-05 11:12:51,284 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2019-08-05 11:12:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,284 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-05 11:12:51,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:12:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-05 11:12:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:12:51,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,285 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1] [2019-08-05 11:12:51,285 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash -171035535, now seen corresponding path program 98 times [2019-08-05 11:12:51,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:55,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:12:55,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:12:55,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:12:55,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:12:55,404 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 101 states. [2019-08-05 11:12:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,822 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-05 11:12:55,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:12:55,823 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2019-08-05 11:12:55,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,824 INFO L225 Difference]: With dead ends: 203 [2019-08-05 11:12:55,824 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 11:12:55,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:12:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 11:12:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-08-05 11:12:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:12:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-08-05 11:12:55,827 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2019-08-05 11:12:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,827 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-08-05 11:12:55,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:12:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-08-05 11:12:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:12:55,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,828 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1] [2019-08-05 11:12:55,829 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1156363914, now seen corresponding path program 99 times [2019-08-05 11:12:55,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:00,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:13:00,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:13:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:13:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:13:00,052 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 102 states. [2019-08-05 11:13:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:00,392 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-08-05 11:13:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:13:00,392 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2019-08-05 11:13:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:00,394 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:13:00,394 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 11:13:00,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:13:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 11:13:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-08-05 11:13:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 11:13:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2019-08-05 11:13:00,397 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2019-08-05 11:13:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,397 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2019-08-05 11:13:00,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:13:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2019-08-05 11:13:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-08-05 11:13:00,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,398 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1] [2019-08-05 11:13:00,398 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1130836283, now seen corresponding path program 100 times [2019-08-05 11:13:00,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:05,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:05,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:13:05,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:13:05,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:13:05,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:13:05,031 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 103 states. [2019-08-05 11:13:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,370 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-08-05 11:13:05,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:13:05,370 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 203 [2019-08-05 11:13:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,372 INFO L225 Difference]: With dead ends: 207 [2019-08-05 11:13:05,372 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 11:13:05,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:13:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 11:13:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-08-05 11:13:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 11:13:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-05 11:13:05,376 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2019-08-05 11:13:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,376 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-05 11:13:05,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:13:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-05 11:13:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-05 11:13:05,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,377 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1] [2019-08-05 11:13:05,378 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,378 INFO L82 PathProgramCache]: Analyzing trace with hash 106970048, now seen corresponding path program 101 times [2019-08-05 11:13:05,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:10,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:13:10,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:13:10,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:13:10,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:13:10,113 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 104 states. [2019-08-05 11:13:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,456 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-08-05 11:13:10,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:13:10,456 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 205 [2019-08-05 11:13:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,458 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:13:10,458 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 11:13:10,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:13:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 11:13:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-08-05 11:13:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-08-05 11:13:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-08-05 11:13:10,462 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2019-08-05 11:13:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,462 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-08-05 11:13:10,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:13:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-08-05 11:13:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-08-05 11:13:10,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,463 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1] [2019-08-05 11:13:10,464 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash -280971003, now seen corresponding path program 102 times [2019-08-05 11:13:10,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:15,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:13:15,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:13:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:13:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:13:15,293 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 105 states. [2019-08-05 11:13:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,651 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-08-05 11:13:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:13:15,651 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 207 [2019-08-05 11:13:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,652 INFO L225 Difference]: With dead ends: 211 [2019-08-05 11:13:15,652 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 11:13:15,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:13:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 11:13:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-08-05 11:13:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-08-05 11:13:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2019-08-05 11:13:15,656 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2019-08-05 11:13:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,656 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2019-08-05 11:13:15,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:13:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2019-08-05 11:13:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-08-05 11:13:15,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,657 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1] [2019-08-05 11:13:15,657 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash 569833738, now seen corresponding path program 103 times [2019-08-05 11:13:15,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:20,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:20,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:13:20,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:13:20,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:13:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:13:20,566 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 106 states. [2019-08-05 11:13:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:20,950 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-08-05 11:13:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:13:20,950 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 209 [2019-08-05 11:13:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:20,951 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:13:20,952 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 11:13:20,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:13:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 11:13:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-08-05 11:13:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 11:13:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-05 11:13:20,956 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2019-08-05 11:13:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:20,956 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-05 11:13:20,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:13:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-05 11:13:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-05 11:13:20,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:20,957 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1] [2019-08-05 11:13:20,957 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2145563697, now seen corresponding path program 104 times [2019-08-05 11:13:20,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:20,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:13:20,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:25,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:25,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:13:25,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:13:25,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:13:25,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:13:25,904 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 107 states. [2019-08-05 11:13:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:26,325 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-08-05 11:13:26,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:13:26,325 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 211 [2019-08-05 11:13:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:26,326 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:13:26,326 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 11:13:26,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:13:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 11:13:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-08-05 11:13:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 11:13:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-08-05 11:13:26,330 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2019-08-05 11:13:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:26,330 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-08-05 11:13:26,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:13:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-08-05 11:13:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:13:26,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:26,331 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1] [2019-08-05 11:13:26,331 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:26,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:26,331 INFO L82 PathProgramCache]: Analyzing trace with hash -302382764, now seen corresponding path program 105 times [2019-08-05 11:13:26,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:26,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:13:26,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:31,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:31,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:13:31,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:13:31,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:13:31,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:13:31,364 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 108 states. [2019-08-05 11:13:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:31,806 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-08-05 11:13:31,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:13:31,807 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 213 [2019-08-05 11:13:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:31,808 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:13:31,808 INFO L226 Difference]: Without dead ends: 216 [2019-08-05 11:13:31,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:13:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-08-05 11:13:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-08-05 11:13:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 11:13:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-08-05 11:13:31,811 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2019-08-05 11:13:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:31,811 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-08-05 11:13:31,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:13:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-08-05 11:13:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-08-05 11:13:31,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:31,812 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1] [2019-08-05 11:13:31,813 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:31,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1467967897, now seen corresponding path program 106 times [2019-08-05 11:13:31,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:31,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:13:31,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:36,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:36,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:13:36,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:13:36,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:13:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:13:36,902 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 109 states. [2019-08-05 11:13:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:37,277 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-08-05 11:13:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:13:37,277 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 215 [2019-08-05 11:13:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:37,278 INFO L225 Difference]: With dead ends: 219 [2019-08-05 11:13:37,278 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 11:13:37,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:13:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 11:13:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-08-05 11:13:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-05 11:13:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-05 11:13:37,282 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2019-08-05 11:13:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:37,282 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-05 11:13:37,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:13:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-05 11:13:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-05 11:13:37,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:37,283 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1] [2019-08-05 11:13:37,283 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1967903902, now seen corresponding path program 107 times [2019-08-05 11:13:37,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:37,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:13:37,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:42,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:13:42,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:13:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:13:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:13:42,498 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 110 states. Received shutdown request... [2019-08-05 11:13:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:13:42,584 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:13:42,590 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:13:42,591 INFO L202 PluginConnector]: Adding new model loop-nondet.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:13:42 BoogieIcfgContainer [2019-08-05 11:13:42,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:13:42,595 INFO L168 Benchmark]: Toolchain (without parser) took 241571.73 ms. Allocated memory was 133.7 MB in the beginning and 769.1 MB in the end (delta: 635.4 MB). Free memory was 110.0 MB in the beginning and 328.9 MB in the end (delta: -218.9 MB). Peak memory consumption was 416.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:42,595 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:13:42,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.99 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:42,597 INFO L168 Benchmark]: Boogie Preprocessor took 23.54 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.0 MB in the end (delta: 933.8 kB). Peak memory consumption was 933.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:13:42,597 INFO L168 Benchmark]: RCFGBuilder took 343.19 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 97.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:42,598 INFO L168 Benchmark]: TraceAbstraction took 241164.31 ms. Allocated memory was 133.7 MB in the beginning and 769.1 MB in the end (delta: 635.4 MB). Free memory was 97.4 MB in the beginning and 328.9 MB in the end (delta: -231.5 MB). Peak memory consumption was 403.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:42,603 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.22 ms. Allocated memory is still 133.7 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.99 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.54 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.0 MB in the end (delta: 933.8 kB). Peak memory consumption was 933.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 343.19 ms. Allocated memory is still 133.7 MB. Free memory was 107.0 MB in the beginning and 97.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241164.31 ms. Allocated memory was 133.7 MB in the beginning and 769.1 MB in the end (delta: 635.4 MB). Free memory was 97.4 MB in the beginning and 328.9 MB in the end (delta: -231.5 MB). Peak memory consumption was 403.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (218states) and FLOYD_HOARE automaton (currently 24 states, 110 states before enhancement),while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 241.0s OverallTime, 109 OverallIterations, 107 TraceHistogramMax, 22.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 1 SDslu, 1006 SDs, 0 SdLazy, 12711 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11775 GetRequests, 5888 SyntacticMatches, 0 SemanticMatches, 5887 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 210.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 108 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 215.9s InterpolantComputationTime, 11884 NumberOfCodeBlocks, 11884 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 11775 ConstructedInterpolants, 0 QuantifiedInterpolants, 11921127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 18209 ConjunctsInSsa, 6104 ConjunctsInUnsatCore, 109 InterpolantComputations, 2 PerfectInterpolantSequences, 0/414090 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown