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/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:35:27,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:35:27,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:35:27,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:35:27,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:35:27,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:35:27,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:35:27,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:35:27,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:35:27,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:35:27,973 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:35:27,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:35:27,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:35:27,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:35:27,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:35:27,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:35:27,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:35:27,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:35:27,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:35:27,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:35:27,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:35:27,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:35:27,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:35:27,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:35:28,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:35:28,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:35:28,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:35:28,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:35:28,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:35:28,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:35:28,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:35:28,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:35:28,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:35:28,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:35:28,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:35:28,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:35:28,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:35:28,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:35:28,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:35:28,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:35:28,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:35:28,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:35:28,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:35:28,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:35:28,068 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:35:28,069 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:35:28,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl [2019-08-05 10:35:28,069 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalCake.bpl' [2019-08-05 10:35:28,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:35:28,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:35:28,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:28,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:35:28,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:35:28,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,128 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:35:28,128 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:35:28,128 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:35:28,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:35:28,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:35:28,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:35:28,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:35:28,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... [2019-08-05 10:35:28,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:35:28,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:35:28,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:35:28,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:35:28,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:35:28,223 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:35:28,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:35:28,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:35:28,463 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:35:28,463 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:35:28,465 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:28 BoogieIcfgContainer [2019-08-05 10:35:28,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:35:28,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:35:28,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:35:28,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:35:28,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:35:28" (1/2) ... [2019-08-05 10:35:28,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5beb9556 and model type GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:35:28, skipping insertion in model container [2019-08-05 10:35:28,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:35:28" (2/2) ... [2019-08-05 10:35:28,477 INFO L109 eAbstractionObserver]: Analyzing ICFG GeometricalCake.bpl [2019-08-05 10:35:28,488 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:35:28,496 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:35:28,512 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:35:28,536 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:35:28,537 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:35:28,537 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:35:28,537 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:35:28,537 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:35:28,538 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:35:28,538 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:35:28,538 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:35:28,538 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:35:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-08-05 10:35:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:35:28,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:28,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:35:28,563 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 10:35:28,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:28,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:35:28,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:28,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:35:28,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:35:28,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:35:28,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:35:28,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:35:28,705 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-08-05 10:35:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:28,759 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:35:28,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:35:28,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:35:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:28,772 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:35:28,772 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 10:35:28,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:35:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 10:35:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 10:35:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 10:35:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 10:35:28,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 10:35:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:28,803 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 10:35:28,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:35:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 10:35:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:35:28,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:28,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:35:28,804 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 10:35:28,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:28,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:35:28,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,034 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 10:35:29,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:35:29,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:35:29,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:35:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:35:29,041 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 10:35:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,080 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:35:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:35:29,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:35:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,081 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:35:29,081 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:35:29,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:35:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:35:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:35:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:35:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:35:29,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:35:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,085 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:35:29,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:35:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:35:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:35:29,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,086 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 10:35:29,087 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,087 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-05 10:35:29,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,249 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 10:35:29,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:35:29,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:35:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:35:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:29,251 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:35:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,310 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:35:29,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:35:29,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:35:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,312 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:35:29,312 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:35:29,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:35:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:35:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:35:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:35:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:35:29,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:35:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,316 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:35:29,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:35:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:35:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:35:29,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,316 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 10:35:29,317 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-05 10:35:29,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,519 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 10:35:29,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:35:29,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:35:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:35:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:29,521 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:35:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:29,625 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:35:29,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:35:29,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:35:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:29,627 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:35:29,627 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:35:29,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:35:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:35:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:35:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:35:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:35:29,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:35:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:29,630 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:35:29,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:35:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:35:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:35:29,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:29,631 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 10:35:29,632 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2019-08-05 10:35:29,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:29,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:35:29,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:29,975 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 10:35:29,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:29,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:35:29,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:35:29,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:35:29,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:29,977 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:35:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,035 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:35:30,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:35:30,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:35:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,037 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:35:30,037 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:35:30,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:35:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:35:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:35:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:35:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:35:30,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:35:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,041 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:35:30,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:35:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:35:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:35:30,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,042 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 10:35:30,043 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2019-08-05 10:35:30,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,332 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 10:35:30,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:35:30,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:35:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:35:30,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:30,335 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:35:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,444 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:35:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:35:30,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:35:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,446 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:35:30,446 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:35:30,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:35:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:35:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:35:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:35:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:35:30,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:35:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,449 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:35:30,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:35:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:35:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:35:30,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,450 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 10:35:30,451 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2019-08-05 10:35:30,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,835 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 10:35:30,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:35:30,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:35:30,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:35:30,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:30,837 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:35:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:31,147 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:35:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:35:31,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:35:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:31,148 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:35:31,148 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:35:31,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:35:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:35:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:35:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:35:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:35:31,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:35:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:31,152 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:35:31,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:35:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:35:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:35:31,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:31,152 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 10:35:31,153 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2019-08-05 10:35:31,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:31,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:35:31,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:31,501 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 10:35:31,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:31,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:35:31,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:35:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:35:31,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:31,503 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:35:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:31,637 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:35:31,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:35:31,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:35:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:31,639 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:35:31,639 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:35:31,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:35:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:35:31,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:35:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:35:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:35:31,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:35:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:31,643 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:35:31,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:35:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:35:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:35:31,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:31,644 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 10:35:31,645 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:31,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2019-08-05 10:35:31,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:31,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:35:31,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:32,088 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 10:35:32,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:32,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:35:32,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:35:32,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:35:32,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:32,090 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:35:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:32,232 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:35:32,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:35:32,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:35:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:32,234 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:35:32,234 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:35:32,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:35:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:35:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:35:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:35:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:35:32,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:35:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:32,237 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:35:32,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:35:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:35:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:35:32,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:32,238 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 10:35:32,239 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2019-08-05 10:35:32,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:32,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:35:32,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:32,836 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 10:35:32,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:32,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:35:32,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:35:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:35:32,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:32,840 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:35:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:33,017 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:35:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:35:33,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:35:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:33,018 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:35:33,019 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:35:33,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:35:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:35:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:35:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:35:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:35:33,023 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:35:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:33,023 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:35:33,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:35:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:35:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:35:33,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:33,024 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 10:35:33,024 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:33,024 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2019-08-05 10:35:33,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:33,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:35:33,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:33,480 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 10:35:33,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:33,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:35:33,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:35:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:35:33,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:33,483 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:35:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:33,699 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:35:33,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:35:33,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:35:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:33,700 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:35:33,700 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:35:33,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:35:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:35:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:35:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:35:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:35:33,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:35:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:33,705 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:35:33,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:35:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:35:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:35:33,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:33,705 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 10:35:33,706 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2019-08-05 10:35:33,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:33,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:35:33,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:34,490 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 10:35:34,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:34,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:35:34,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:35:34,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:35:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:34,493 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:35:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:34,702 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:35:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:35:34,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:35:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:34,704 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:35:34,704 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:35:34,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:35:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:35:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:35:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:35:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:35:34,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:35:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:34,709 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:35:34,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:35:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:35:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:35:34,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:34,710 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 10:35:34,710 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:34,711 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2019-08-05 10:35:34,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:34,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:35:34,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:35,296 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 10:35:35,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:35,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:35:35,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:35:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:35:35,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:35,299 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:35:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:35,498 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:35:35,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:35:35,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:35:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:35,500 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:35:35,500 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:35:35,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:35:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:35:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:35:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:35:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:35:35,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:35:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:35,504 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:35:35,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:35:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:35:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:35:35,505 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:35,505 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 10:35:35,505 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:35,506 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2019-08-05 10:35:35,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:35,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:35:35,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:36,090 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 10:35:36,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:36,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:35:36,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:35:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:35:36,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:36,092 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:35:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:36,580 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:35:36,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:35:36,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:35:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:36,582 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:35:36,582 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:35:36,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:35:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:35:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:35:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:35:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:35:36,586 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:35:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:36,586 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:35:36,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:35:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:35:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:35:36,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:36,587 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-05 10:35:36,587 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:36,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2019-08-05 10:35:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:36,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:35:36,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:37,107 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 10:35:37,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:37,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:35:37,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:35:37,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:35:37,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:37,109 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:35:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:37,512 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:35:37,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:35:37,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:35:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:37,514 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:35:37,514 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:35:37,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:35:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:35:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:35:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:35:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:35:37,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:35:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:37,517 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:35:37,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:35:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:35:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:35:37,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:37,518 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-05 10:35:37,519 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2019-08-05 10:35:37,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:37,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:35:37,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:38,165 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 10:35:38,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:38,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:35:38,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:35:38,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:35:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:38,167 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:35:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:38,476 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:35:38,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:35:38,477 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:35:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:38,478 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:35:38,478 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:35:38,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:35:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:35:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:35:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:35:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:35:38,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:35:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:38,483 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:35:38,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:35:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:35:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:35:38,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:38,484 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-05 10:35:38,484 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2019-08-05 10:35:38,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:38,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:35:38,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:39,296 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 10:35:39,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:39,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:35:39,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:35:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:35:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:39,298 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:35:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:39,667 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:35:39,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:35:39,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:35:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:39,669 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:35:39,669 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:35:39,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:35:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:35:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:35:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:35:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:35:39,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:35:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:39,673 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:35:39,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:35:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:35:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:35:39,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:39,674 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-05 10:35:39,674 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:39,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2019-08-05 10:35:39,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:39,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:35:39,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:40,705 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 10:35:40,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:40,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:35:40,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:35:40,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:35:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:40,707 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:35:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:41,141 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:35:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:35:41,142 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:35:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:41,143 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:35:41,143 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:35:41,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:35:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:35:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:35:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:35:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:35:41,148 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:35:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:41,149 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:35:41,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:35:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:35:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:35:41,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:41,150 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-05 10:35:41,150 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:41,151 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2019-08-05 10:35:41,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:41,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:35:41,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:41,794 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 10:35:41,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:41,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:35:41,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:35:41,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:35:41,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:41,797 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:35:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:42,286 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:35:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:35:42,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:35:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:42,288 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:35:42,288 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:35:42,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:35:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:35:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:35:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:35:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:35:42,291 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:35:42,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:42,292 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:35:42,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:35:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:35:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:35:42,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:42,292 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-05 10:35:42,293 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:42,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:42,293 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2019-08-05 10:35:42,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:42,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:35:42,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:43,027 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 10:35:43,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:43,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:35:43,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:35:43,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:35:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:43,029 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:35:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:43,558 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:35:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:35:43,559 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:35:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:43,560 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:35:43,560 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:35:43,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:35:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:35:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:35:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:35:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:35:43,564 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:35:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:43,564 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:35:43,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:35:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:35:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:35:43,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:43,565 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-05 10:35:43,565 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2019-08-05 10:35:43,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:43,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:35:43,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:44,297 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 10:35:44,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:44,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:35:44,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:35:44,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:35:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:44,299 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:35:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:44,835 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:35:44,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:35:44,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:35:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:44,837 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:35:44,837 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:35:44,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:35:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:35:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:35:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:35:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:35:44,840 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:35:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:44,841 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:35:44,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:35:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:35:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:35:44,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:44,842 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-05 10:35:44,842 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:44,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2019-08-05 10:35:44,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:44,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:35:44,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:45,662 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 10:35:45,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:45,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:35:45,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:35:45,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:35:45,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:45,664 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:35:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:46,398 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:35:46,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:35:46,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:35:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:46,402 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:35:46,402 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:35:46,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:35:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:35:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:35:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:35:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:35:46,404 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:35:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:46,405 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:35:46,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:35:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:35:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:35:46,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:46,406 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-05 10:35:46,406 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2019-08-05 10:35:46,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:46,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:35:46,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:47,339 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 10:35:47,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:47,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:35:47,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:35:47,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:35:47,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:47,340 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:35:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:48,122 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:35:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:35:48,123 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:35:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:48,123 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:35:48,123 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:35:48,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:35:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:35:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:35:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:35:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:35:48,127 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:35:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:48,128 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:35:48,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:35:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:35:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:35:48,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:48,129 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-05 10:35:48,129 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2019-08-05 10:35:48,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:48,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:35:48,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:50,122 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 10:35:50,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:50,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:35:50,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:35:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:35:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:50,124 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:35:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:51,249 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:35:51,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:35:51,250 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:35:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:51,250 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:35:51,250 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:35:51,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:35:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:35:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:35:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:35:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:35:51,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:35:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:51,255 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:35:51,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:35:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:35:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:35:51,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:51,256 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-05 10:35:51,256 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2019-08-05 10:35:51,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:51,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:35:51,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:52,570 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 10:35:52,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:52,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:35:52,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:35:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:35:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:52,572 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:35:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:53,573 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:35:53,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:35:53,574 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:35:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:53,575 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:35:53,575 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:35:53,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:35:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:35:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:35:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:35:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:35:53,579 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:35:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:53,579 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:35:53,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:35:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:35:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:35:53,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:53,580 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-05 10:35:53,580 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:53,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:53,581 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2019-08-05 10:35:53,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:53,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:35:53,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:54,772 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 10:35:54,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:54,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:35:54,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:35:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:35:54,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:54,773 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:35:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:55,681 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:35:55,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:35:55,681 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:35:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:55,682 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:35:55,682 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:35:55,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:35:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:35:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:35:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:35:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:35:55,686 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:35:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:55,686 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:35:55,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:35:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:35:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:35:55,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:55,687 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-05 10:35:55,688 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:55,688 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2019-08-05 10:35:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:55,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:35:55,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:58,103 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 10:35:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:35:58,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:35:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:35:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:58,105 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:35:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:59,112 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:35:59,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:35:59,112 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:35:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:59,113 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:35:59,113 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:35:59,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:35:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:35:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:35:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:35:59,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:35:59,117 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:35:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:59,117 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:35:59,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:35:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:35:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:35:59,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:59,118 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-05 10:35:59,118 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2019-08-05 10:35:59,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:59,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:35:59,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:00,452 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 10:36:00,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:00,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:36:00,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:36:00,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:36:00,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:36:00,454 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:36:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:01,530 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:36:01,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:36:01,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:36:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:01,532 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:36:01,532 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:36:01,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:36:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:36:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:36:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:36:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:36:01,536 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:36:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:01,536 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:36:01,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:36:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:36:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:36:01,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:01,537 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-05 10:36:01,537 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:01,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2019-08-05 10:36:01,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:01,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:36:01,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:03,405 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 10:36:03,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:03,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:36:03,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:36:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:36:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:36:03,406 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:36:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:04,575 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:36:04,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:36:04,575 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:36:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:04,576 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:36:04,576 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:36:04,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:36:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:36:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:36:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:36:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:36:04,580 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:36:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:04,581 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:36:04,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:36:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:36:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:36:04,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:04,582 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-05 10:36:04,582 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:04,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2019-08-05 10:36:04,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:04,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:36:04,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:06,150 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 10:36:06,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:06,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:36:06,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:36:06,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:36:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:36:06,152 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:36:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:07,402 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:36:07,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:36:07,402 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:36:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:07,403 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:36:07,403 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:36:07,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:36:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:36:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:36:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:36:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:36:07,407 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:36:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:07,407 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:36:07,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:36:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:36:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:36:07,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:07,408 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-05 10:36:07,408 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2019-08-05 10:36:07,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:07,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:36:07,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:09,332 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 10:36:09,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:09,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:36:09,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:36:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:36:09,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:36:09,334 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:36:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:10,693 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:36:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:36:10,693 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:36:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:10,694 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:36:10,694 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:36:10,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:36:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:36:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:36:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:36:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:36:10,698 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:36:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:10,699 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:36:10,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:36:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:36:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:36:10,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:10,699 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-05 10:36:10,700 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2019-08-05 10:36:10,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:10,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:36:10,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:12,720 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 10:36:12,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:12,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:36:12,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:36:12,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:36:12,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:12,721 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:36:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:14,303 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:36:14,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:36:14,303 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:36:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:14,304 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:36:14,304 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:36:14,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:36:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:36:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:36:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:36:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:36:14,308 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:36:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:14,308 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:36:14,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:36:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:36:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:36:14,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:14,309 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-05 10:36:14,309 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:14,309 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2019-08-05 10:36:14,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:14,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:36:14,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:16,245 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 10:36:16,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:16,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:36:16,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:36:16,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:36:16,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:16,247 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:36:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:17,821 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:36:17,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:36:17,822 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:36:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:17,823 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:36:17,823 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:36:17,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:36:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:36:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:36:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:36:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:36:17,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:36:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:17,827 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:36:17,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:36:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:36:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:36:17,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:17,828 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-05 10:36:17,828 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:17,829 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2019-08-05 10:36:17,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:18,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:36:18,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:20,193 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 10:36:20,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:20,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:36:20,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:36:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:36:20,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:20,195 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:36:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:21,897 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:36:21,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:36:21,898 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:36:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:21,898 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:36:21,898 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:36:21,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:36:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:36:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:36:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:36:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:36:21,902 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:36:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:21,902 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:36:21,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:36:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:36:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:36:21,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:21,903 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-05 10:36:21,903 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2019-08-05 10:36:21,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:22,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:36:22,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:24,269 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 10:36:24,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:24,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:36:24,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:36:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:36:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:24,270 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:36:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:26,244 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:36:26,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:36:26,244 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:36:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:26,245 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:36:26,245 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:36:26,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:36:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:36:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:36:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:36:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:36:26,248 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:36:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:26,248 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:36:26,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:36:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:36:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:36:26,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:26,249 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-05 10:36:26,249 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2019-08-05 10:36:26,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:26,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:36:26,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:29,141 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 10:36:29,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:29,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:36:29,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:36:29,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:36:29,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:29,142 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:36:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:31,259 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:36:31,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:36:31,259 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:36:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:31,260 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:36:31,260 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:36:31,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:36:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:36:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:36:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:36:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:36:31,264 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:36:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:31,265 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:36:31,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:36:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:36:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:36:31,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:31,265 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-05 10:36:31,266 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:31,266 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2019-08-05 10:36:31,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:31,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:36:31,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:34,007 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 10:36:34,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:34,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:36:34,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:36:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:36:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:34,009 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:36:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:36,186 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:36:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:36:36,186 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:36:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:36,187 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:36:36,187 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:36:36,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:36:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:36:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:36:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:36:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:36:36,191 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:36:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:36,191 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:36:36,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:36:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:36:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:36:36,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:36,192 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-05 10:36:36,192 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:36,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:36,192 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2019-08-05 10:36:36,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:36,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:36:36,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:39,204 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 10:36:39,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:39,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:36:39,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:36:39,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:36:39,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:39,206 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:36:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:41,572 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:36:41,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:36:41,573 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:36:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:41,574 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:36:41,574 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:36:41,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:36:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:36:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:36:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:36:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:36:41,577 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:36:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:41,577 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:36:41,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:36:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:36:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:36:41,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:41,578 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-05 10:36:41,578 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2019-08-05 10:36:41,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:42,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:36:42,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:44,661 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 10:36:44,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:44,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:36:44,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:36:44,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:36:44,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:44,662 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:36:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:47,256 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:36:47,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:36:47,257 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:36:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:47,258 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:36:47,258 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:36:47,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:36:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:36:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:36:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:36:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:36:47,262 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:36:47,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:47,262 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:36:47,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:36:47,262 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:36:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:36:47,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:47,263 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-05 10:36:47,263 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:47,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:47,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2019-08-05 10:36:47,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:47,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:36:47,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:50,640 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 10:36:50,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:50,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:36:50,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:36:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:36:50,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:50,642 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:36:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:53,370 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:36:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:36:53,370 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:36:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:53,371 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:36:53,371 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:36:53,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:36:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:36:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:36:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:36:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:36:53,374 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:36:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:53,375 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:36:53,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:36:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:36:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:36:53,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:53,375 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-05 10:36:53,375 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:53,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2019-08-05 10:36:53,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:53,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:36:53,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:57,012 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 10:36:57,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:57,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:36:57,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:36:57,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:36:57,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:57,014 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:36:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:59,996 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:36:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:36:59,997 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:36:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:59,998 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:36:59,998 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:36:59,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:36:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:37:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:37:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:37:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:37:00,001 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:37:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:00,001 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:37:00,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:37:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:37:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:37:00,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:00,002 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-05 10:37:00,002 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2019-08-05 10:37:00,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:00,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:37:00,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:03,778 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 10:37:03,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:03,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:37:03,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:37:03,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:37:03,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:03,780 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:37:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:06,919 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:37:06,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:37:06,920 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:37:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:06,920 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:37:06,920 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:37:06,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:37:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:37:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:37:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:37:06,923 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:37:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:06,924 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:37:06,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:37:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:37:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:37:06,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:06,924 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-05 10:37:06,925 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2019-08-05 10:37:06,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:07,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:37:07,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:10,976 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 10:37:10,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:10,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:37:10,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:37:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:37:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:10,978 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:37:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:14,304 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:37:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:37:14,304 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:37:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:14,305 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:37:14,305 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:37:14,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:37:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:37:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:37:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:37:14,309 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:37:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:14,309 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:37:14,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:37:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:37:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:37:14,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:14,310 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-05 10:37:14,310 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2019-08-05 10:37:14,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:15,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:37:15,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:18,760 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 10:37:18,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:18,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:37:18,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:37:18,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:37:18,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:18,762 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:37:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:22,356 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:37:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:37:22,356 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:37:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:22,357 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:37:22,357 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:37:22,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:37:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:37:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:37:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:37:22,360 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:37:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:22,360 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:37:22,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:37:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:37:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:37:22,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:22,361 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-05 10:37:22,362 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2019-08-05 10:37:22,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:23,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:37:23,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:26,888 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 10:37:26,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:26,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:37:26,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:37:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:37:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:26,890 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:37:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:30,671 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:37:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:37:30,671 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:37:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:30,672 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:37:30,672 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:37:30,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:37:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:37:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:37:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:37:30,674 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:37:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:30,674 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:37:30,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:37:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:37:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:37:30,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:30,675 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-05 10:37:30,676 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2019-08-05 10:37:30,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:31,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:37:31,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:35,614 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 10:37:35,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:35,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:37:35,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:37:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:37:35,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:35,615 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:37:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:39,633 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:37:39,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:37:39,633 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:37:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:39,634 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:37:39,634 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:37:39,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:37:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:37:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:37:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:37:39,637 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:37:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:39,637 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:37:39,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:37:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:37:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:37:39,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:39,638 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-05 10:37:39,638 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2019-08-05 10:37:39,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:40,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:37:40,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:44,916 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 10:37:44,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:44,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:37:44,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:37:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:37:44,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:44,918 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:37:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:49,088 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:37:49,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:37:49,088 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:37:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:49,089 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:37:49,089 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:37:49,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:37:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:37:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:37:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:37:49,091 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:37:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:49,092 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:37:49,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:37:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:37:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:37:49,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:49,092 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-05 10:37:49,092 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2019-08-05 10:37:49,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:50,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:37:50,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:54,667 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 10:37:54,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:54,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:37:54,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:37:54,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:37:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:54,668 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:37:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:59,087 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:37:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:37:59,087 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:37:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:59,088 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:37:59,088 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:37:59,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:37:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:37:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:37:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:37:59,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:37:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:59,091 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:37:59,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:37:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:37:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:37:59,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:59,092 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-05 10:37:59,092 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:37:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2019-08-05 10:37:59,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:00,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:38:00,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:05,166 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 10:38:05,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:05,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:38:05,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:38:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:38:05,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:05,167 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:38:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:10,008 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:38:10,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:38:10,009 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:38:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:10,010 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:38:10,010 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:38:10,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:38:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:38:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:38:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:38:10,013 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:38:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:10,014 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:38:10,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:38:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:38:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:38:10,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:10,014 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-05 10:38:10,015 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:10,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2019-08-05 10:38:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:11,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:38:11,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:16,108 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 10:38:16,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:16,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:38:16,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:38:16,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:38:16,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:16,109 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:38:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:20,997 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:38:20,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:38:20,997 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:38:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:20,998 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:38:20,998 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:38:20,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:38:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:38:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:38:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:38:21,001 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:38:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:21,002 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:38:21,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:38:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:38:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:38:21,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:21,002 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-05 10:38:21,003 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:21,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2019-08-05 10:38:21,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:22,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:38:22,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:27,664 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 10:38:27,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:27,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:38:27,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:38:27,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:38:27,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:27,666 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:38:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:32,889 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:38:32,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:38:32,890 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:38:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:32,891 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:38:32,891 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:38:32,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:38:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:38:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:38:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:38:32,893 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:38:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:32,894 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:38:32,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:38:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:38:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:38:32,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:32,894 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-05 10:38:32,895 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2019-08-05 10:38:32,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:34,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:38:34,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:39,778 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 10:38:39,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:39,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:38:39,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:38:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:38:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:39,780 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:38:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:45,212 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:38:45,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:38:45,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:38:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:45,213 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:38:45,214 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:38:45,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:38:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:38:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:38:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:38:45,217 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:38:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:45,217 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:38:45,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:38:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:38:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:38:45,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:45,218 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-05 10:38:45,218 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2019-08-05 10:38:45,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:46,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:38:46,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:52,595 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 10:38:52,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:52,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:38:52,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:38:52,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:38:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:52,597 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:38:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:58,341 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:38:58,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:38:58,342 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:38:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:58,343 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:38:58,343 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:38:58,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:38:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:38:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:38:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:38:58,345 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:38:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:58,346 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:38:58,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:38:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:38:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:38:58,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:58,346 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-05 10:38:58,347 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:38:58,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:58,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2019-08-05 10:38:58,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:59,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:38:59,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:06,072 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 10:39:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:39:06,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:39:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:39:06,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:39:06,073 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:39:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:12,128 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:39:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:39:12,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:39:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:12,129 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:39:12,129 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:39:12,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:39:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:39:12,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:39:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:39:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:39:12,131 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:39:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:12,131 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:39:12,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:39:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:39:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:39:12,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:12,132 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-05 10:39:12,132 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:12,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2019-08-05 10:39:12,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:13,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:39:13,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:20,240 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 10:39:20,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:20,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:39:20,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:39:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:39:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:39:20,241 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:39:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:26,505 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:39:26,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:39:26,505 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:39:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:26,506 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:39:26,506 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:39:26,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:39:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:39:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:39:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:39:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:39:26,509 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:39:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:26,510 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:39:26,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:39:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:39:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:39:26,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:26,510 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-05 10:39:26,511 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2019-08-05 10:39:26,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:28,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:39:28,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:35,039 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 10:39:35,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:35,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:39:35,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:39:35,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:39:35,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:39:35,040 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:39:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:41,678 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:39:41,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:39:41,679 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:39:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:41,680 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:39:41,680 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:39:41,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:39:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:39:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:39:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:39:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:39:41,682 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:39:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:41,682 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:39:41,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:39:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:39:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:39:41,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:41,683 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-05 10:39:41,683 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:41,684 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2019-08-05 10:39:41,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,605 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 10:39:50,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:50,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:39:50,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:39:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:39:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:39:50,606 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. Received shutdown request... [2019-08-05 10:39:56,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:39:56,901 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:39:56,908 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:39:56,908 INFO L202 PluginConnector]: Adding new model GeometricalCake.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:39:56 BoogieIcfgContainer [2019-08-05 10:39:56,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:39:56,910 INFO L168 Benchmark]: Toolchain (without parser) took 268813.96 ms. Allocated memory was 140.5 MB in the beginning and 264.8 MB in the end (delta: 124.3 MB). Free memory was 108.9 MB in the beginning and 143.6 MB in the end (delta: -34.7 MB). Peak memory consumption was 89.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:56,911 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:39:56,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.04 ms. Allocated memory is still 140.5 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:56,913 INFO L168 Benchmark]: Boogie Preprocessor took 22.72 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:56,913 INFO L168 Benchmark]: RCFGBuilder took 311.00 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 96.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:56,914 INFO L168 Benchmark]: TraceAbstraction took 268439.27 ms. Allocated memory was 140.5 MB in the beginning and 264.8 MB in the end (delta: 124.3 MB). Free memory was 96.7 MB in the beginning and 143.6 MB in the end (delta: -46.9 MB). Peak memory consumption was 77.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:39:56,917 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.16 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 109.9 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 34.04 ms. Allocated memory is still 140.5 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.72 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 311.00 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 96.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 268439.27 ms. Allocated memory was 140.5 MB in the beginning and 264.8 MB in the end (delta: 124.3 MB). Free memory was 96.7 MB in the beginning and 143.6 MB in the end (delta: -46.9 MB). Peak memory consumption was 77.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (59states) and FLOYD_HOARE automaton (currently 55 states, 59 states before enhancement),while ReachableStatesComputation was computing reachable states (53 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. TIMEOUT Result, 268.3s OverallTime, 57 OverallIterations, 56 TraceHistogramMax, 115.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 113 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 62493 SolverSat, 1593 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1653 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1653 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 125.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=56, 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.1s AutomataMinimizationTime, 56 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 146.1s InterpolantComputationTime, 1710 NumberOfCodeBlocks, 1710 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1653 ConstructedInterpolants, 0 QuantifiedInterpolants, 677183 SizeOfPredicates, 56 NumberOfNonLiveVariables, 6783 ConjunctsInSsa, 3362 ConjunctsInUnsatCore, 57 InterpolantComputations, 1 PerfectInterpolantSequences, 0/30856 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown