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/regression/bpl/interprocedural/BugNestedSsaWithPendingContexts.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:08:51,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:08:51,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:08:51,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:08:51,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:08:51,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:08:51,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:08:51,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:08:51,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:08:51,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:08:51,978 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:08:51,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:08:51,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:08:51,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:08:51,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:08:51,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:08:51,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:08:51,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:08:51,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:08:51,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:08:51,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:08:51,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:08:52,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:08:52,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:08:52,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:08:52,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:08:52,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:08:52,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:08:52,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:08:52,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:08:52,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:08:52,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:08:52,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:08:52,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:08:52,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:08:52,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:08:52,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:08:52,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:08:52,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:08:52,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:08:52,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:08:52,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:08:52,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:08:52,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:08:52,068 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:08:52,068 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:08:52,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/interprocedural/BugNestedSsaWithPendingContexts.bpl [2019-08-05 11:08:52,069 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/interprocedural/BugNestedSsaWithPendingContexts.bpl' [2019-08-05 11:08:52,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:08:52,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:08:52,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:52,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:08:52,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:08:52,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,139 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:08:52,140 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:08:52,140 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:08:52,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:52,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:08:52,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:08:52,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:08:52,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/1) ... [2019-08-05 11:08:52,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:08:52,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:08:52,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:08:52,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:08:52,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (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:08:52,245 INFO L130 BoogieDeclarations]: Found specification of procedure increaseByTwo [2019-08-05 11:08:52,246 INFO L138 BoogieDeclarations]: Found implementation of procedure increaseByTwo [2019-08-05 11:08:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure decreaseByOne [2019-08-05 11:08:52,246 INFO L138 BoogieDeclarations]: Found implementation of procedure decreaseByOne [2019-08-05 11:08:52,246 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 11:08:52,247 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 11:08:52,599 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:08:52,599 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-08-05 11:08:52,600 INFO L202 PluginConnector]: Adding new model BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:52 BoogieIcfgContainer [2019-08-05 11:08:52,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:08:52,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:08:52,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:08:52,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:08:52,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:52" (1/2) ... [2019-08-05 11:08:52,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb3ed79 and model type BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:08:52, skipping insertion in model container [2019-08-05 11:08:52,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:52" (2/2) ... [2019-08-05 11:08:52,608 INFO L109 eAbstractionObserver]: Analyzing ICFG BugNestedSsaWithPendingContexts.bpl [2019-08-05 11:08:52,618 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:08:52,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:08:52,645 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:08:52,674 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:08:52,675 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:08:52,675 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:08:52,675 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:08:52,675 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:08:52,676 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:08:52,676 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:08:52,676 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:08:52,676 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:08:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:08:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:08:52,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:52,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:08:52,699 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1129, now seen corresponding path program 1 times [2019-08-05 11:08:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:52,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:52,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:52,896 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:08:52,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:52,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:52,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:52,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:52,950 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 11:08:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:53,023 INFO L93 Difference]: Finished difference Result 10 states and 8 transitions. [2019-08-05 11:08:53,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:53,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:08:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:53,039 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:08:53,039 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 11:08:53,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 11:08:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 11:08:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 11:08:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 11:08:53,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 11:08:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:53,082 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 11:08:53,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 11:08:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:08:53,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:53,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:08:53,084 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash 34888, now seen corresponding path program 1 times [2019-08-05 11:08:53,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:53,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:08:53,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:53,217 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:08:53,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:53,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 11:08:53,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:08:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:08:53,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:08:53,221 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 11:08:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:53,248 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:08:53,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:08:53,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:08:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:53,249 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:08:53,250 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:08:53,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:08:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:08:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:08:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:08:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:08:53,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:08:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:53,253 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:08:53,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:08:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:08:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:08:53,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:53,254 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 11:08:53,254 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:53,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1081417, now seen corresponding path program 2 times [2019-08-05 11:08:53,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:53,266 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:08:53,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:53,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:53,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:08:53,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:08:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:08:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:08:53,391 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 11:08:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:53,441 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:08:53,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:08:53,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 11:08:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:53,443 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:08:53,443 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:08:53,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:08:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:08:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:08:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:08:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:08:53,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:08:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:53,446 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:08:53,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:08:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:08:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:08:53,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:53,447 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 11:08:53,447 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:53,448 INFO L82 PathProgramCache]: Analyzing trace with hash 33523816, now seen corresponding path program 3 times [2019-08-05 11:08:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:53,461 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:08:53,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:53,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:53,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:08:53,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:08:53,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:08:53,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:08:53,582 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 11:08:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:53,747 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:08:53,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:08:53,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 11:08:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:53,750 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:08:53,750 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:08:53,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:08:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:08:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:08:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:08:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:08:53,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:08:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:53,753 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:08:53,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:08:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:08:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:08:53,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:53,754 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 11:08:53,755 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1039238185, now seen corresponding path program 4 times [2019-08-05 11:08:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:53,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:08:53,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:54,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:54,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:08:54,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:08:54,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:08:54,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:08:54,002 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 11:08:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:54,111 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:08:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:08:54,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 11:08:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:54,112 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:08:54,112 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:08:54,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:08:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:08:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:08:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:08:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:08:54,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:08:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:54,116 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:08:54,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:08:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:08:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:08:54,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:54,117 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 11:08:54,118 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2143354744, now seen corresponding path program 5 times [2019-08-05 11:08:54,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:54,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:08:54,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:54,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:54,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:08:54,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:08:54,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:08:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:54,269 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 11:08:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:54,369 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:08:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:08:54,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 11:08:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:54,371 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:08:54,372 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:08:54,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:08:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:08:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:08:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:08:54,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:08:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:54,376 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:08:54,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:08:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:08:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:08:54,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:54,377 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 11:08:54,377 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2019487735, now seen corresponding path program 6 times [2019-08-05 11:08:54,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:54,396 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:08:54,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:54,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:54,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:08:54,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:08:54,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:08:54,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:54,775 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 11:08:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:54,893 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:08:54,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:08:54,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 11:08:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:54,896 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:08:54,896 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:08:54,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:08:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:08:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:08:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:08:54,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:08:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:54,899 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:08:54,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:08:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:08:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:08:54,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:54,900 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 11:08:54,901 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:54,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:54,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1820389544, now seen corresponding path program 7 times [2019-08-05 11:08:54,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:54,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:08:54,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:55,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:55,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:08:55,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:08:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:08:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:55,207 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 11:08:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:55,307 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:08:55,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:55,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 11:08:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:55,309 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:08:55,310 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:08:55,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:08:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:08:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:08:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:08:55,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:08:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:55,313 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:08:55,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:08:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:08:55,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:55,314 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 11:08:55,314 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:55,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:55,315 INFO L82 PathProgramCache]: Analyzing trace with hash 597500905, now seen corresponding path program 8 times [2019-08-05 11:08:55,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:55,333 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:08:55,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:55,541 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:08:55,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:55,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:08:55,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:08:55,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:08:55,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:55,543 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 11:08:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:55,697 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:08:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:08:55,699 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 11:08:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:55,700 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:08:55,700 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:08:55,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:08:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:08:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:08:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:08:55,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:08:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:55,704 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:08:55,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:08:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:08:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:08:55,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:55,705 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 11:08:55,713 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:55,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1342658760, now seen corresponding path program 9 times [2019-08-05 11:08:55,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:55,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:08:55,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:55,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:55,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:08:55,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:08:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:08:55,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:08:55,976 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 11:08:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:56,080 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:08:56,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:08:56,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 11:08:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:56,082 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:08:56,082 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:08:56,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:08:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:08:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:08:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:08:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:08:56,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:08:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:56,087 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:08:56,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:08:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:08:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:08:56,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:56,087 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 11:08:56,088 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1327251511, now seen corresponding path program 10 times [2019-08-05 11:08:56,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:56,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:08:56,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:56,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:56,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:08:56,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:08:56,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:08:56,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:08:56,282 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 11:08:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:56,396 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:08:56,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:08:56,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 11:08:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:56,398 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:08:56,398 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:08:56,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:08:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:08:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:08:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:08:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:08:56,402 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:08:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:56,402 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:08:56,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:08:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:08:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:08:56,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:56,403 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 11:08:56,403 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:56,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1804876008, now seen corresponding path program 11 times [2019-08-05 11:08:56,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:56,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:08:56,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:56,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:56,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:08:56,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:08:56,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:08:56,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:08:56,634 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 11:08:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:56,799 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:08:56,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:08:56,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 11:08:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:56,801 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:08:56,801 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:08:56,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:08:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:08:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:08:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:08:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:08:56,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:08:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:56,806 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:08:56,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:08:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:08:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:08:56,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:56,809 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 11:08:56,809 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:56,810 INFO L82 PathProgramCache]: Analyzing trace with hash 116581289, now seen corresponding path program 12 times [2019-08-05 11:08:56,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:56,827 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:08:56,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:57,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:57,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:08:57,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:08:57,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:08:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:08:57,368 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 11:08:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:57,551 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:08:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:08:57,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 11:08:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:57,553 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:08:57,553 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:08:57,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:08:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:08:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:08:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:08:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:08:57,559 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:08:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:57,559 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:08:57,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:08:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:08:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:08:57,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:57,560 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 11:08:57,560 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash -680947448, now seen corresponding path program 13 times [2019-08-05 11:08:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:57,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:08:57,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:57,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:57,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:08:57,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:08:57,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:08:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:08:57,778 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 11:08:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:58,106 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:08:58,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:08:58,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 11:08:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:58,108 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:08:58,108 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:08:58,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:08:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:08:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:08:58,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:08:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:08:58,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:08:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:58,112 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:08:58,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:08:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:08:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:08:58,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:58,113 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-05 11:08:58,113 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash 365465481, now seen corresponding path program 14 times [2019-08-05 11:08:58,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:58,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:08:58,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:58,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:58,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:08:58,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:08:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:08:58,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:08:58,365 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 11:08:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:58,713 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:08:58,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:08:58,713 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 11:08:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:58,714 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:08:58,714 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:08:58,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:08:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:08:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:08:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:08:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:08:58,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:08:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:58,722 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:08:58,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:08:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:08:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:08:58,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:58,727 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-05 11:08:58,727 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1555472088, now seen corresponding path program 15 times [2019-08-05 11:08:58,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:58,764 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:08:58,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:59,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:59,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:08:59,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:08:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:08:59,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:08:59,499 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 11:08:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:59,706 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:08:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:08:59,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 11:08:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:59,707 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:08:59,708 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:08:59,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:08:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:08:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:08:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:08:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:08:59,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:08:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:59,712 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:08:59,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:08:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:08:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:08:59,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:59,713 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-05 11:08:59,713 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -974994583, now seen corresponding path program 16 times [2019-08-05 11:08:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:59,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:08:59,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:00,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:09:00,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:00,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:00,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:00,111 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 11:09:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:00,395 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:09:00,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:00,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 11:09:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:00,396 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:09:00,397 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:09:00,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:09:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:09:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:09:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:09:00,400 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:09:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:00,400 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:09:00,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:09:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:09:00,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:00,401 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-05 11:09:00,401 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash -160061112, now seen corresponding path program 17 times [2019-08-05 11:09:00,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:00,417 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:09:00,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:00,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:00,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:09:00,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:09:00,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:09:00,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:00,775 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 11:09:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:01,099 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:09:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:09:01,100 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 11:09:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:01,100 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:09:01,101 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:09:01,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:09:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:09:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:09:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:09:01,105 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:09:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:01,106 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:09:01,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:09:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:09:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:09:01,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:01,107 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-05 11:09:01,107 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash -666927287, now seen corresponding path program 18 times [2019-08-05 11:09:01,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:01,122 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:09:01,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:01,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:01,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:01,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:09:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:09:01,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:01,428 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 11:09:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:01,730 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:09:01,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:01,730 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 11:09:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:01,731 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:09:01,732 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:09:01,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:09:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:09:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:09:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:09:01,736 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:09:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:01,736 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:09:01,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:09:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:09:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:09:01,737 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:01,737 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-05 11:09:01,737 INFO L418 AbstractCegarLoop]: === Iteration 20 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:01,738 INFO L82 PathProgramCache]: Analyzing trace with hash 800090472, now seen corresponding path program 19 times [2019-08-05 11:09:01,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:01,752 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:09:01,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:02,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:02,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:09:02,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:09:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:09:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:09:02,118 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 11:09:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:02,485 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:09:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:09:02,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 11:09:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:02,487 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:09:02,487 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:09:02,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:09:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:09:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:09:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:09:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:09:02,491 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:09:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:02,492 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:09:02,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:09:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:09:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:09:02,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:02,493 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-05 11:09:02,493 INFO L418 AbstractCegarLoop]: === Iteration 21 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -966999255, now seen corresponding path program 20 times [2019-08-05 11:09:02,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:02,508 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:09:02,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:02,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:02,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:09:02,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:09:02,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:09:02,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:02,957 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 11:09:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:03,295 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:09:03,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:09:03,296 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 11:09:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:03,297 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:09:03,297 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:09:03,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:09:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:09:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:09:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:09:03,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:09:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:03,301 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:09:03,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:09:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:09:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:09:03,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:03,302 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-05 11:09:03,302 INFO L418 AbstractCegarLoop]: === Iteration 22 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash 87794056, now seen corresponding path program 21 times [2019-08-05 11:09:03,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:03,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:09:03,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:03,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:03,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:09:03,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:09:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:09:03,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:09:03,753 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 11:09:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:04,186 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:09:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:09:04,188 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 11:09:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:04,189 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:09:04,189 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:09:04,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:09:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:09:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:09:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:09:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:09:04,192 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 11:09:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:04,193 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:09:04,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:09:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:09:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:09:04,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:04,194 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-05 11:09:04,194 INFO L418 AbstractCegarLoop]: === Iteration 23 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:04,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1573351671, now seen corresponding path program 22 times [2019-08-05 11:09:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:04,207 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:09:04,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:04,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:04,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:09:04,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:09:04,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:09:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:09:04,585 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 11:09:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:05,087 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:09:05,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:09:05,088 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 11:09:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:05,089 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:09:05,089 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:09:05,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:09:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:09:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:09:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:09:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:09:05,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 11:09:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:05,092 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:09:05,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:09:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:09:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:09:05,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:05,093 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-05 11:09:05,094 INFO L418 AbstractCegarLoop]: === Iteration 24 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1529261656, now seen corresponding path program 23 times [2019-08-05 11:09:05,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:05,108 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:09:05,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:05,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:05,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:09:05,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:09:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:09:05,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:05,680 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 11:09:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:06,559 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:09:06,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:09:06,559 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 11:09:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:06,560 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:09:06,560 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:09:06,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:09:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:09:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:09:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:09:06,564 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 11:09:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:06,564 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:09:06,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:09:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:09:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:09:06,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:06,565 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-05 11:09:06,565 INFO L418 AbstractCegarLoop]: === Iteration 25 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:06,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:06,566 INFO L82 PathProgramCache]: Analyzing trace with hash -162471191, now seen corresponding path program 24 times [2019-08-05 11:09:06,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:06,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:09:06,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:07,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:07,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:09:07,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:09:07,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:09:07,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:09:07,012 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 11:09:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:07,570 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:09:07,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:09:07,571 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 11:09:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:07,572 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:09:07,572 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:09:07,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:09:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:09:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:09:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:09:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:09:07,576 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 11:09:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:07,576 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:09:07,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:09:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:09:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:09:07,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:07,577 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-05 11:09:07,577 INFO L418 AbstractCegarLoop]: === Iteration 26 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -741639736, now seen corresponding path program 25 times [2019-08-05 11:09:07,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:07,592 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:09:07,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:08,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:08,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:09:08,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:09:08,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:09:08,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:09:08,337 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 11:09:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:08,839 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:09:08,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:09:08,840 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 11:09:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:08,840 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:09:08,840 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:09:08,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:09:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:09:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:09:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:09:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:09:08,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 11:09:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:08,844 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:09:08,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:09:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:09:08,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:09:08,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:08,845 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-05 11:09:08,846 INFO L418 AbstractCegarLoop]: === Iteration 27 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:08,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1515995447, now seen corresponding path program 26 times [2019-08-05 11:09:08,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:08,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:09:08,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:09,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:09,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:09:09,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:09:09,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:09:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:09:09,579 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 11:09:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:10,151 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:09:10,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:09:10,151 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 11:09:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:10,152 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:09:10,152 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:09:10,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:09:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:09:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:09:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:09:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:09:10,154 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 11:09:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:10,155 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:09:10,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:09:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:09:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:09:10,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:10,156 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-05 11:09:10,156 INFO L418 AbstractCegarLoop]: === Iteration 28 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash 248781288, now seen corresponding path program 27 times [2019-08-05 11:09:10,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:10,170 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:09:10,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:10,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:10,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:09:10,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:09:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:09:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:09:10,883 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 11:09:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:11,489 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:09:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:09:11,490 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 11:09:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:11,491 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:09:11,491 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:09:11,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:09:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:09:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:09:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:09:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:09:11,495 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 11:09:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:11,495 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:09:11,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:09:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:09:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:09:11,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:11,496 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-05 11:09:11,496 INFO L418 AbstractCegarLoop]: === Iteration 29 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -877714775, now seen corresponding path program 28 times [2019-08-05 11:09:11,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:11,510 WARN L254 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:09:11,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:12,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:12,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:09:12,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:09:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:09:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:09:12,836 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 11:09:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:13,456 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:09:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:09:13,458 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 11:09:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:13,458 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:09:13,459 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:09:13,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:09:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:09:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:09:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:09:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:09:13,463 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 11:09:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:13,463 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:09:13,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:09:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:09:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:09:13,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:13,464 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-05 11:09:13,464 INFO L418 AbstractCegarLoop]: === Iteration 30 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1439354360, now seen corresponding path program 29 times [2019-08-05 11:09:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:13,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 11:09:13,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:15,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:15,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:09:15,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:09:15,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:09:15,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:09:15,951 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 11:09:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:16,614 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:09:16,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:09:16,614 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 11:09:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:16,615 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:09:16,615 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:09:16,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:09:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:09:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:09:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:09:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:09:16,619 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 11:09:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:16,620 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:09:16,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:09:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:09:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:09:16,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:16,620 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-05 11:09:16,621 INFO L418 AbstractCegarLoop]: === Iteration 31 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:16,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1670312311, now seen corresponding path program 30 times [2019-08-05 11:09:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:16,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 11:09:16,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:17,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:17,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:09:17,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:09:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:09:17,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:09:17,269 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 11:09:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:17,976 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:09:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:09:17,977 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 11:09:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:17,978 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:09:17,978 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:09:17,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:09:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:09:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:09:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:09:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:09:17,982 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 11:09:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:17,982 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:09:17,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:09:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:09:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:09:17,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:17,983 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-05 11:09:17,984 INFO L418 AbstractCegarLoop]: === Iteration 32 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:17,984 INFO L82 PathProgramCache]: Analyzing trace with hash -240074200, now seen corresponding path program 31 times [2019-08-05 11:09:17,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:17,999 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 11:09:18,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:18,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:18,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:09:18,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:09:18,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:09:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:09:18,691 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 11:09:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:19,446 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:09:19,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:09:19,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 11:09:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:19,447 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:09:19,448 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:09:19,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:09:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:09:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:09:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:09:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:09:19,452 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 11:09:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:19,452 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:09:19,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:09:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:09:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:09:19,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:19,453 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-05 11:09:19,453 INFO L418 AbstractCegarLoop]: === Iteration 33 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1147634281, now seen corresponding path program 32 times [2019-08-05 11:09:19,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:19,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 11:09:19,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:20,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:20,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:09:20,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:09:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:09:20,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:09:20,069 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 11:09:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:21,078 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:09:21,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:09:21,078 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 11:09:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:21,079 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:09:21,079 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:09:21,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:09:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:09:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:09:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:09:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:09:21,083 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 11:09:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:21,084 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:09:21,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:09:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:09:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:09:21,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:21,084 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-05 11:09:21,085 INFO L418 AbstractCegarLoop]: === Iteration 34 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:21,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:21,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1216924232, now seen corresponding path program 33 times [2019-08-05 11:09:21,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:21,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 11:09:21,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:22,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:22,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:09:22,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:09:22,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:09:22,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:09:22,010 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 11:09:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:22,853 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:09:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:09:22,853 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 11:09:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:22,854 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:09:22,854 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:09:22,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:09:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:09:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:09:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:09:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:09:22,857 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 11:09:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:22,858 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:09:22,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:09:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:09:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:09:22,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:22,858 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-05 11:09:22,858 INFO L418 AbstractCegarLoop]: === Iteration 35 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash -930054583, now seen corresponding path program 34 times [2019-08-05 11:09:22,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:22,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 11:09:22,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:23,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:23,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:09:23,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:09:23,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:09:23,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:09:23,559 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 11:09:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:24,463 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:09:24,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:09:24,463 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 11:09:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:24,464 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:09:24,464 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:09:24,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:09:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:09:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:09:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:09:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:09:24,467 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 11:09:24,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:24,468 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:09:24,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:09:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:09:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:09:24,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:24,468 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-05 11:09:24,468 INFO L418 AbstractCegarLoop]: === Iteration 36 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:24,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1233078888, now seen corresponding path program 35 times [2019-08-05 11:09:24,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:24,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 11:09:24,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:25,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:25,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:09:25,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:09:25,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:09:25,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:09:25,992 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 11:09:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:26,935 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:09:26,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:09:26,936 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 11:09:26,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:26,936 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:09:26,936 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:09:26,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:09:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:09:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:09:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:09:26,939 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 11:09:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:26,940 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:09:26,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:09:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:09:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:09:26,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:26,940 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-05 11:09:26,941 INFO L418 AbstractCegarLoop]: === Iteration 37 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash -429260247, now seen corresponding path program 36 times [2019-08-05 11:09:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:26,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 11:09:26,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:27,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:27,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:09:27,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:09:27,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:09:27,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:09:27,754 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 11:09:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:28,766 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:09:28,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:09:28,768 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 11:09:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:28,768 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:09:28,768 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:09:28,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:09:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:09:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:09:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:09:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:09:28,771 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 11:09:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:28,771 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:09:28,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:09:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:09:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:09:28,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:28,772 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-05 11:09:28,772 INFO L418 AbstractCegarLoop]: === Iteration 38 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash -422165880, now seen corresponding path program 37 times [2019-08-05 11:09:28,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:28,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 11:09:28,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:29,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:29,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:09:29,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:09:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:09:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:09:29,608 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 11:09:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:30,716 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:09:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:09:30,717 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 11:09:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:30,717 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:09:30,717 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:09:30,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:09:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:09:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:09:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:09:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:09:30,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 11:09:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:30,719 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:09:30,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:09:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:09:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:30,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:30,720 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-05 11:09:30,720 INFO L418 AbstractCegarLoop]: === Iteration 39 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash -202240503, now seen corresponding path program 38 times [2019-08-05 11:09:30,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:30,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 11:09:30,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:31,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:31,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:09:31,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:09:31,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:09:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:09:31,655 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 11:09:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:32,757 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:09:32,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:09:32,758 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 11:09:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:32,759 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:09:32,759 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:09:32,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:09:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:09:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:09:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:09:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:09:32,762 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 11:09:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:32,762 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:09:32,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:09:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:09:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:09:32,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:32,763 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-05 11:09:32,763 INFO L418 AbstractCegarLoop]: === Iteration 40 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:32,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:32,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1974488408, now seen corresponding path program 39 times [2019-08-05 11:09:32,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:32,781 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 11:09:32,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:33,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:33,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:09:33,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:09:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:09:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:09:33,670 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 11:09:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:34,829 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:09:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:09:34,829 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 11:09:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:34,830 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:09:34,830 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:09:34,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:09:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:09:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:09:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:09:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:09:34,834 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 11:09:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:34,834 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:09:34,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:09:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:09:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:09:34,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:34,835 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-05 11:09:34,835 INFO L418 AbstractCegarLoop]: === Iteration 41 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1079598615, now seen corresponding path program 40 times [2019-08-05 11:09:34,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:34,852 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 11:09:34,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:35,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:35,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:09:35,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:09:35,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:09:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:09:35,822 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 11:09:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:37,150 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:09:37,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:09:37,150 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 11:09:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:37,151 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:09:37,151 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:09:37,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:09:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:09:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:09:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:09:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:09:37,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 11:09:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:37,155 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:09:37,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:09:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:09:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:09:37,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:37,156 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-05 11:09:37,156 INFO L418 AbstractCegarLoop]: === Iteration 42 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash 892181192, now seen corresponding path program 41 times [2019-08-05 11:09:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:37,174 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 11:09:37,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:38,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:38,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:09:38,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:09:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:09:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:09:38,199 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 11:09:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,495 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:09:39,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:09:39,495 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 11:09:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,496 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:09:39,496 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:09:39,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:09:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:09:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:09:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:09:39,500 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 11:09:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,500 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:09:39,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:09:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:09:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:09:39,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,501 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-05 11:09:39,501 INFO L418 AbstractCegarLoop]: === Iteration 43 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1887813065, now seen corresponding path program 42 times [2019-08-05 11:09:39,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:39,520 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 11:09:39,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:40,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:09:40,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:09:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:09:40,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:09:40,532 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 11:09:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,038 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:09:42,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:09:42,039 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 11:09:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,039 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:09:42,039 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:09:42,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:09:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:09:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:09:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:09:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:09:42,043 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 11:09:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,043 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:09:42,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:09:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:09:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:42,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,044 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-05 11:09:42,044 INFO L418 AbstractCegarLoop]: === Iteration 44 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1607337240, now seen corresponding path program 43 times [2019-08-05 11:09:42,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:43,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:43,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:09:43,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:09:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:09:43,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:09:43,083 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 11:09:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,497 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:09:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:09:44,498 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 11:09:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,498 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:09:44,499 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:09:44,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:09:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:09:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:09:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:09:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:09:44,502 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 11:09:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,502 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:09:44,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:09:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:09:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:09:44,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,503 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-05 11:09:44,504 INFO L418 AbstractCegarLoop]: === Iteration 45 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1712153001, now seen corresponding path program 44 times [2019-08-05 11:09:44,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:45,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:09:45,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:09:45,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:09:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:45,541 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 11:09:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,223 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:09:47,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:09:47,224 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 11:09:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,224 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:09:47,224 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:09:47,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:09:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:09:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:09:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:09:47,227 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 11:09:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,228 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:09:47,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:09:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:09:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:47,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,229 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-05 11:09:47,229 INFO L418 AbstractCegarLoop]: === Iteration 46 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1537135368, now seen corresponding path program 45 times [2019-08-05 11:09:47,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,250 WARN L254 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:48,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:09:48,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:09:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:09:48,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:09:48,343 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 11:09:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:49,883 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:09:49,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:09:49,883 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 11:09:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:49,884 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:09:49,885 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:09:49,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:09:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:09:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:09:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:09:49,887 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 11:09:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:49,888 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:09:49,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:09:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:09:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:09:49,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:49,888 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-05 11:09:49,889 INFO L418 AbstractCegarLoop]: === Iteration 47 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:49,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:49,889 INFO L82 PathProgramCache]: Analyzing trace with hash 406556041, now seen corresponding path program 46 times [2019-08-05 11:09:49,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:49,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 11:09:49,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:51,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:51,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:09:51,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:09:51,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:09:51,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:09:51,037 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 11:09:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:52,781 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:09:52,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:09:52,782 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 11:09:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:52,783 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:09:52,783 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:09:52,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:09:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:09:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:09:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:09:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:09:52,786 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 11:09:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:52,786 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:09:52,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:09:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:09:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:09:52,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:52,787 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-05 11:09:52,787 INFO L418 AbstractCegarLoop]: === Iteration 48 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash -281664728, now seen corresponding path program 47 times [2019-08-05 11:09:52,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:52,812 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 11:09:52,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:53,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:53,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:09:53,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:09:53,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:09:53,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:09:53,983 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 11:09:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,643 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:09:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:09:55,644 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 11:09:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,645 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:09:55,645 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:09:55,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:09:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:09:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:09:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:09:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:09:55,648 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 11:09:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,648 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:09:55,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:09:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:09:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:09:55,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,649 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-05 11:09:55,649 INFO L418 AbstractCegarLoop]: === Iteration 49 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,649 INFO L82 PathProgramCache]: Analyzing trace with hash -141672087, now seen corresponding path program 48 times [2019-08-05 11:09:55,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:57,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:57,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:09:57,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:09:57,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:09:57,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:09:57,072 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 11:09:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,811 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:09:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:09:58,812 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 11:09:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,812 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:09:58,813 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:09:58,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:09:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:09:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:09:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:09:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:09:58,816 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 11:09:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,817 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:09:58,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:09:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:09:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:09:58,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,817 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-05 11:09:58,818 INFO L418 AbstractCegarLoop]: === Iteration 50 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,818 INFO L82 PathProgramCache]: Analyzing trace with hash -96867512, now seen corresponding path program 49 times [2019-08-05 11:09:58,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,842 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,042 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:00,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:00,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:10:00,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:10:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:10:00,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:10:00,043 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 11:10:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,993 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:10:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:10:01,994 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 11:10:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,994 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:10:01,995 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:10:01,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:10:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:10:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:10:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:10:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:10:01,998 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 11:10:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,999 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:10:01,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:10:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:10:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:10:01,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,999 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-05 11:10:02,000 INFO L418 AbstractCegarLoop]: === Iteration 51 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1292074313, now seen corresponding path program 50 times [2019-08-05 11:10:02,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:10:03,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:10:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:10:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:10:03,366 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 11:10:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,228 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:10:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:10:05,229 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 11:10:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,230 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:10:05,230 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:10:05,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:10:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:10:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:10:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:10:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:10:05,233 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 11:10:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,233 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:10:05,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:10:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:10:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:10:05,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,234 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-05 11:10:05,234 INFO L418 AbstractCegarLoop]: === Iteration 52 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1399597928, now seen corresponding path program 51 times [2019-08-05 11:10:05,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,261 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:06,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:10:06,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:10:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:10:06,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:10:06,898 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 11:10:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,837 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:10:08,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:10:08,837 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 11:10:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,838 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:10:08,838 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:10:08,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:10:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:10:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:10:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:10:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:10:08,842 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 11:10:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,842 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:10:08,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:10:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:10:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:08,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,843 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-05 11:10:08,843 INFO L418 AbstractCegarLoop]: === Iteration 53 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash 437862697, now seen corresponding path program 52 times [2019-08-05 11:10:08,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,871 WARN L254 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:10,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:10:10,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:10:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:10:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:10:10,224 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 11:10:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,381 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:10:12,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:10:12,382 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 11:10:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,383 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:10:12,383 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:10:12,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:10:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:10:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:10:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:10:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:10:12,385 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 11:10:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,386 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:10:12,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:10:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:10:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:10:12,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,387 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-05 11:10:12,387 INFO L418 AbstractCegarLoop]: === Iteration 54 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,387 INFO L82 PathProgramCache]: Analyzing trace with hash 688841608, now seen corresponding path program 53 times [2019-08-05 11:10:12,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:13,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:13,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:10:13,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:10:13,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:10:13,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:10:13,823 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 11:10:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,904 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:10:15,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:10:15,905 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 11:10:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,906 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:10:15,906 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:10:15,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:10:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:10:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:10:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:10:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:10:15,909 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 11:10:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,909 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:10:15,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:10:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:10:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:10:15,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,910 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-05 11:10:15,911 INFO L418 AbstractCegarLoop]: === Iteration 55 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,911 INFO L82 PathProgramCache]: Analyzing trace with hash -120746743, now seen corresponding path program 54 times [2019-08-05 11:10:15,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,938 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:17,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:17,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:10:17,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:10:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:10:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:10:17,650 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 11:10:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,820 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:10:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:10:19,821 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 11:10:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,822 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:10:19,822 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:10:19,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:10:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:10:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:10:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:10:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:10:19,825 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 11:10:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,825 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:10:19,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:10:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:10:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:10:19,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,826 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-05 11:10:19,826 INFO L418 AbstractCegarLoop]: === Iteration 56 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash 551818152, now seen corresponding path program 55 times [2019-08-05 11:10:19,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,847 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:21,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:21,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:10:21,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:10:21,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:10:21,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:10:21,342 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 11:10:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:23,757 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:10:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:10:23,758 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 11:10:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:23,759 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:10:23,759 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:10:23,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:10:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:10:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:10:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:10:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:10:23,761 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 11:10:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:23,762 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:10:23,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:10:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:10:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:10:23,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:23,762 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-05 11:10:23,762 INFO L418 AbstractCegarLoop]: === Iteration 57 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:23,763 INFO L82 PathProgramCache]: Analyzing trace with hash -73506583, now seen corresponding path program 56 times [2019-08-05 11:10:23,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:23,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 11:10:23,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:25,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:10:25,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:10:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:10:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:10:25,325 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 11:10:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:27,817 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:10:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:10:27,817 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 11:10:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:27,818 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:10:27,818 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:10:27,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:10:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:10:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:10:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:10:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:10:27,821 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 11:10:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:27,822 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:10:27,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:10:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:10:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:10:27,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:27,823 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1] [2019-08-05 11:10:27,823 INFO L418 AbstractCegarLoop]: === Iteration 58 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2016263112, now seen corresponding path program 57 times [2019-08-05 11:10:27,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:27,852 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 11:10:27,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:29,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:10:29,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:10:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:10:29,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:10:29,432 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 11:10:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,852 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:10:31,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:10:31,853 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 11:10:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,854 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:10:31,854 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:10:31,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:10:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:10:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:10:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:10:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:10:31,857 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 11:10:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,857 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:10:31,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:10:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:10:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:10:31,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,858 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1] [2019-08-05 11:10:31,858 INFO L418 AbstractCegarLoop]: === Iteration 59 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1920353079, now seen corresponding path program 58 times [2019-08-05 11:10:31,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:34,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:34,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:10:34,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:10:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:10:34,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:10:34,207 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 11:10:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,696 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:10:36,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:10:36,697 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 11:10:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,698 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:10:36,698 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:10:36,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:10:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:10:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:10:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:10:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:10:36,700 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 11:10:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,701 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:10:36,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:10:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:10:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:10:36,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,701 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1] [2019-08-05 11:10:36,702 INFO L418 AbstractCegarLoop]: === Iteration 60 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash 598596584, now seen corresponding path program 59 times [2019-08-05 11:10:36,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:38,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:10:38,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:10:38,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:10:38,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:10:38,763 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 11:10:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,336 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:10:41,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:10:41,336 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 11:10:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,337 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:10:41,337 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:10:41,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:10:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:10:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:10:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:10:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:10:41,340 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 11:10:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,340 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:10:41,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:10:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:10:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:10:41,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,341 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1] [2019-08-05 11:10:41,341 INFO L418 AbstractCegarLoop]: === Iteration 61 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1376624809, now seen corresponding path program 60 times [2019-08-05 11:10:41,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,376 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:43,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:10:43,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:10:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:10:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:10:43,420 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 11:10:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:46,075 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:10:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:10:46,076 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 11:10:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:46,076 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:10:46,077 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:10:46,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:10:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:10:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:10:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:10:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:10:46,079 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 11:10:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:46,079 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:10:46,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:10:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:10:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:10:46,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:46,080 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1] [2019-08-05 11:10:46,080 INFO L418 AbstractCegarLoop]: === Iteration 62 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash -274303992, now seen corresponding path program 61 times [2019-08-05 11:10:46,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:46,116 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 11:10:46,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:48,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:10:48,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:10:48,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:10:48,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:10:48,350 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 11:10:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,096 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:10:51,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:10:51,096 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 11:10:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,097 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:10:51,097 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:10:51,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:10:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:10:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:10:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:10:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:10:51,100 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 11:10:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,101 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:10:51,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:10:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:10:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:10:51,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,102 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1] [2019-08-05 11:10:51,102 INFO L418 AbstractCegarLoop]: === Iteration 63 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash 86510729, now seen corresponding path program 62 times [2019-08-05 11:10:51,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:53,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:10:53,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:10:53,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:10:53,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:10:53,195 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 11:10:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,026 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:10:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:10:56,027 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 11:10:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,028 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:10:56,028 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:10:56,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:10:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:10:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:10:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:10:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:10:56,031 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 11:10:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,032 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:10:56,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:10:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:10:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:10:56,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,032 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1] [2019-08-05 11:10:56,033 INFO L418 AbstractCegarLoop]: === Iteration 64 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1613134808, now seen corresponding path program 63 times [2019-08-05 11:10:56,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,063 WARN L254 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:58,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:10:58,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:10:58,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:10:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:10:58,354 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 11:11:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,289 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:11:01,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:11:01,290 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 11:11:01,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,291 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:11:01,291 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:11:01,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:11:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:11:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:11:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:11:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:11:01,294 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 11:11:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,295 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:11:01,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:11:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:11:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:11:01,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,296 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1] [2019-08-05 11:11:01,296 INFO L418 AbstractCegarLoop]: === Iteration 65 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1532428393, now seen corresponding path program 64 times [2019-08-05 11:11:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:03,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:11:03,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:11:03,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:11:03,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:11:03,655 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 11:11:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,725 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:11:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:11:06,726 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 11:11:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,727 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:11:06,727 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:11:06,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:11:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:11:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:11:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:11:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:11:06,730 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 11:11:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,730 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:11:06,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:11:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:11:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:11:06,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,731 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1] [2019-08-05 11:11:06,731 INFO L418 AbstractCegarLoop]: === Iteration 66 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash 260639816, now seen corresponding path program 65 times [2019-08-05 11:11:06,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 265 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:09,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:09,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:11:09,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:11:09,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:11:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:11:09,153 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 11:11:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,277 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:11:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:11:12,277 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 11:11:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,278 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:11:12,278 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:11:12,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:11:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:11:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:11:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:11:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:11:12,281 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 11:11:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,281 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:11:12,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:11:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:11:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:11:12,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,282 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1] [2019-08-05 11:11:12,282 INFO L418 AbstractCegarLoop]: === Iteration 67 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash -510100407, now seen corresponding path program 66 times [2019-08-05 11:11:12,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,314 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:14,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:11:14,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:11:14,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:11:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:11:14,797 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 11:11:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:18,010 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:11:18,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:11:18,010 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 11:11:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:18,011 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:11:18,011 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:11:18,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:11:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:11:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:11:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:11:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:11:18,014 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 11:11:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:18,014 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:11:18,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:11:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:11:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:11:18,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:18,015 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1] [2019-08-05 11:11:18,015 INFO L418 AbstractCegarLoop]: === Iteration 68 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1366756456, now seen corresponding path program 67 times [2019-08-05 11:11:18,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:18,046 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 11:11:18,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:20,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:11:20,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:11:20,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:11:20,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:11:20,579 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 11:11:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,031 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:11:24,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:11:24,032 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 11:11:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,033 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:11:24,033 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:11:24,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:11:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:11:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:11:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:11:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:11:24,035 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 11:11:24,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,036 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:11:24,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:11:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:11:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:11:24,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:24,037 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1] [2019-08-05 11:11:24,037 INFO L418 AbstractCegarLoop]: === Iteration 69 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash -580222935, now seen corresponding path program 68 times [2019-08-05 11:11:24,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:26,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:26,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:11:26,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:11:26,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:11:26,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:11:26,433 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 11:11:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,055 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:11:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:11:30,055 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 11:11:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,056 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:11:30,056 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:11:30,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:11:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:11:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:11:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:11:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:11:30,059 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 11:11:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,059 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:11:30,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:11:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:11:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:11:30,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,060 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1] [2019-08-05 11:11:30,060 INFO L418 AbstractCegarLoop]: === Iteration 70 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,060 INFO L82 PathProgramCache]: Analyzing trace with hash -807041912, now seen corresponding path program 69 times [2019-08-05 11:11:30,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:32,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:11:32,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:11:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:11:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:11:32,484 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 11:11:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:36,150 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:11:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:11:36,151 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 11:11:36,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:36,152 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:11:36,152 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:11:36,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:11:36,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:11:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:11:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:11:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:11:36,156 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 11:11:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:36,156 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:11:36,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:11:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:11:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:11:36,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:36,157 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1] [2019-08-05 11:11:36,157 INFO L418 AbstractCegarLoop]: === Iteration 71 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:36,157 INFO L82 PathProgramCache]: Analyzing trace with hash 751504393, now seen corresponding path program 70 times [2019-08-05 11:11:36,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:36,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 11:11:36,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:38,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:38,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:11:38,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:11:38,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:11:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:11:38,537 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 11:11:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,511 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:11:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:11:42,512 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 11:11:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,513 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:11:42,513 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:11:42,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:11:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:11:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:11:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:11:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:11:42,519 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 11:11:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,519 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:11:42,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:11:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:11:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:11:42,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,520 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1] [2019-08-05 11:11:42,520 INFO L418 AbstractCegarLoop]: === Iteration 72 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1821799592, now seen corresponding path program 71 times [2019-08-05 11:11:42,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,571 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 289 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:45,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:11:45,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:11:45,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:11:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:11:45,651 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 11:11:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:49,818 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:11:49,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:11:49,818 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 11:11:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:49,819 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:11:49,819 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:11:49,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:11:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:11:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:11:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:11:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:11:49,823 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 11:11:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:49,824 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:11:49,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:11:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:11:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:11:49,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:49,825 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1] [2019-08-05 11:11:49,825 INFO L418 AbstractCegarLoop]: === Iteration 73 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:49,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash 641212393, now seen corresponding path program 72 times [2019-08-05 11:11:49,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:49,877 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 11:11:49,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:53,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:53,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:11:53,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:11:53,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:11:53,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:11:53,804 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 11:11:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:57,755 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:11:57,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:11:57,756 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 11:11:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:57,756 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:11:57,757 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:11:57,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:11:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:11:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:11:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:11:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:11:57,760 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 11:11:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:57,761 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:11:57,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:11:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:11:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:11:57,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:57,761 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1] [2019-08-05 11:11:57,762 INFO L418 AbstractCegarLoop]: === Iteration 74 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1597252408, now seen corresponding path program 73 times [2019-08-05 11:11:57,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:57,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 11:11:57,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:00,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:00,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:12:00,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:12:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:12:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:12:00,690 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 11:12:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:04,741 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:12:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:12:04,742 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 11:12:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:04,742 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:12:04,743 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:12:04,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:12:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:12:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:12:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:12:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:12:04,746 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 11:12:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:04,746 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:12:04,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:12:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:12:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:12:04,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:04,747 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1] [2019-08-05 11:12:04,747 INFO L418 AbstractCegarLoop]: === Iteration 75 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:04,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:04,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2024782793, now seen corresponding path program 74 times [2019-08-05 11:12:04,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:04,788 WARN L254 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 301 conjunts are in the unsatisfiable core [2019-08-05 11:12:04,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:07,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:12:07,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:12:07,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:12:07,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:12:07,395 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 11:12:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:11,551 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:12:11,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:12:11,552 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 11:12:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:11,553 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:12:11,553 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:12:11,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:12:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:12:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:12:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:12:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:12:11,556 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 11:12:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:11,556 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:12:11,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:12:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:12:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:12:11,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:11,557 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1] [2019-08-05 11:12:11,557 INFO L418 AbstractCegarLoop]: === Iteration 76 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1656242968, now seen corresponding path program 75 times [2019-08-05 11:12:11,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:11,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 11:12:11,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:14,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:14,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:12:14,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:12:14,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:12:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:12:14,262 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 11:12:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:18,533 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:12:18,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:12:18,533 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 11:12:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:18,534 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:12:18,534 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:12:18,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:12:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:12:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:12:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:12:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:12:18,537 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 11:12:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:18,537 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:12:18,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:12:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:12:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:12:18,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:18,538 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1] [2019-08-05 11:12:18,538 INFO L418 AbstractCegarLoop]: === Iteration 77 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 196075433, now seen corresponding path program 76 times [2019-08-05 11:12:18,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:18,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-05 11:12:18,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:21,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:21,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:12:21,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:12:21,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:12:21,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:12:21,589 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 11:12:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:25,952 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:12:25,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:12:25,953 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 11:12:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:25,953 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:12:25,954 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:12:25,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:12:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:12:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:12:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:12:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:12:25,957 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 11:12:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:25,957 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:12:25,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:12:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:12:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:12:25,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:25,958 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1] [2019-08-05 11:12:25,958 INFO L418 AbstractCegarLoop]: === Iteration 78 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:25,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1783371016, now seen corresponding path program 77 times [2019-08-05 11:12:25,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:25,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 313 conjunts are in the unsatisfiable core [2019-08-05 11:12:25,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:12:30,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:12:30,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:12:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:12:30,828 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-08-05 11:12:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,319 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:12:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:12:35,319 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2019-08-05 11:12:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,320 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:12:35,320 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:12:35,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:12:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:12:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:12:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:12:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:12:35,324 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 11:12:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,324 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:12:35,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:12:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:12:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:12:35,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,325 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1] [2019-08-05 11:12:35,325 INFO L418 AbstractCegarLoop]: === Iteration 79 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash -550073463, now seen corresponding path program 78 times [2019-08-05 11:12:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:38,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:12:38,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:12:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:12:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:12:38,567 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2019-08-05 11:12:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,122 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:12:43,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:12:43,123 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2019-08-05 11:12:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,124 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:12:43,124 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:12:43,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:12:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:12:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:12:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:12:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:12:43,127 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 11:12:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,127 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:12:43,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:12:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:12:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:12:43,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,128 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1] [2019-08-05 11:12:43,128 INFO L418 AbstractCegarLoop]: === Iteration 80 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,129 INFO L82 PathProgramCache]: Analyzing trace with hash 127591720, now seen corresponding path program 79 times [2019-08-05 11:12:43,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 321 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:46,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:12:46,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:12:46,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:12:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:12:46,346 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2019-08-05 11:12:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,976 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:12:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:12:50,977 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2019-08-05 11:12:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,978 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:12:50,978 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:12:50,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:12:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:12:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:12:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:12:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:12:50,980 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 11:12:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,981 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:12:50,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:12:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:12:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:12:50,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,982 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1] [2019-08-05 11:12:50,982 INFO L418 AbstractCegarLoop]: === Iteration 81 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash -339624087, now seen corresponding path program 80 times [2019-08-05 11:12:50,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 325 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:54,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:12:54,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:12:54,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:12:54,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:12:54,020 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2019-08-05 11:12:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,845 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:12:58,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:12:58,846 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2019-08-05 11:12:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,847 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:12:58,847 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:12:58,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:12:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:12:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:12:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:12:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:12:58,849 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 11:12:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,849 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:12:58,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:12:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:12:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:12:58,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,850 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1] [2019-08-05 11:12:58,850 INFO L418 AbstractCegarLoop]: === Iteration 82 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1938412216, now seen corresponding path program 81 times [2019-08-05 11:12:58,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 329 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:13:01,423 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:13:01,423 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:13:01,427 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:13:01,427 INFO L202 PluginConnector]: Adding new model BugNestedSsaWithPendingContexts.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:13:01 BoogieIcfgContainer [2019-08-05 11:13:01,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:13:01,429 INFO L168 Benchmark]: Toolchain (without parser) took 249324.18 ms. Allocated memory was 139.5 MB in the beginning and 211.3 MB in the end (delta: 71.8 MB). Free memory was 109.0 MB in the beginning and 30.8 MB in the end (delta: 78.1 MB). Peak memory consumption was 150.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:01,430 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 110.2 MB in the beginning and 110.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:13:01,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.00 ms. Allocated memory is still 139.5 MB. Free memory was 109.0 MB in the beginning and 106.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:01,431 INFO L168 Benchmark]: Boogie Preprocessor took 19.95 ms. Allocated memory is still 139.5 MB. Free memory was 106.7 MB in the beginning and 105.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:01,431 INFO L168 Benchmark]: RCFGBuilder took 425.73 ms. Allocated memory is still 139.5 MB. Free memory was 105.5 MB in the beginning and 95.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:01,432 INFO L168 Benchmark]: TraceAbstraction took 248825.44 ms. Allocated memory was 139.5 MB in the beginning and 211.3 MB in the end (delta: 71.8 MB). Free memory was 95.2 MB in the beginning and 30.8 MB in the end (delta: 64.3 MB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:01,435 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 110.2 MB in the beginning and 110.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.00 ms. Allocated memory is still 139.5 MB. Free memory was 109.0 MB in the beginning and 106.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.95 ms. Allocated memory is still 139.5 MB. Free memory was 106.7 MB in the beginning and 105.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 425.73 ms. Allocated memory is still 139.5 MB. Free memory was 105.5 MB in the beginning and 95.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248825.44 ms. Allocated memory was 139.5 MB in the beginning and 211.3 MB in the end (delta: 71.8 MB). Free memory was 95.2 MB in the beginning and 30.8 MB in the end (delta: 64.3 MB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 84 with TraceHistMax 81,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 8 locations, 1 error locations. TIMEOUT Result, 248.7s OverallTime, 82 OverallIterations, 81 TraceHistogramMax, 136.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 187087 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3321 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 105.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=81, 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.2s AutomataMinimizationTime, 81 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 107.7s InterpolantComputationTime, 3402 NumberOfCodeBlocks, 3402 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 3321 ConstructedInterpolants, 0 QuantifiedInterpolants, 1263087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13527 ConjunctsInSsa, 13365 ConjunctsInUnsatCore, 81 InterpolantComputations, 1 PerfectInterpolantSequences, 0/88560 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown