java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:15:21,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:15:21,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:15:21,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:15:21,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:15:21,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:15:21,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:15:21,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:15:21,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:15:21,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:15:21,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:15:21,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:15:21,455 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:15:21,456 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:15:21,457 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:15:21,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:15:21,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:15:21,466 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:15:21,468 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:15:21,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:15:21,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:15:21,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:15:21,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:15:21,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:15:21,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:15:21,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:15:21,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:15:21,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:15:21,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:15:21,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:15:21,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:15:21,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:15:21,484 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:15:21,484 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:15:21,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:15:21,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:15:21,486 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:15:21,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:15:21,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:15:21,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:15:21,501 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:15:21,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:15:21,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:15:21,502 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:15:21,502 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:15:21,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:15:21,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:15:21,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:15:21,566 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:15:21,566 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:15:21,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-07-23 15:15:21,568 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-07-23 15:15:21,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:15:21,624 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:15:21,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:15:21,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:15:21,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:15:21,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/1) ... [2018-07-23 15:15:21,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/1) ... [2018-07-23 15:15:21,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/1) ... [2018-07-23 15:15:21,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/1) ... [2018-07-23 15:15:21,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/1) ... [2018-07-23 15:15:21,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/1) ... [2018-07-23 15:15:21,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/1) ... [2018-07-23 15:15:21,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:15:21,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:15:21,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:15:21,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:15:21,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/1) ... [2018-07-23 15:15:21,770 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-23 15:15:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-23 15:15:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-23 15:15:21,955 INFO L258 CfgBuilder]: Using library mode [2018-07-23 15:15:21,956 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:15:21 BoogieIcfgContainer [2018-07-23 15:15:21,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:15:21,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:15:21,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:15:21,961 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:15:21,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:21" (1/2) ... [2018-07-23 15:15:21,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f57add1 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:15:21, skipping insertion in model container [2018-07-23 15:15:21,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:15:21" (2/2) ... [2018-07-23 15:15:21,966 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-07-23 15:15:21,976 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:15:21,985 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-07-23 15:15:22,036 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:15:22,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:15:22,038 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:15:22,038 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:15:22,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:15:22,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:15:22,039 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:15:22,039 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:15:22,039 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:15:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-07-23 15:15:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 15:15:22,065 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:22,066 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-23 15:15:22,067 INFO L414 AbstractCegarLoop]: === Iteration 1 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-07-23 15:15:22,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:22,174 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:22,175 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:15:22,179 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:15:22,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:15:22,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:15:22,195 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-07-23 15:15:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:22,457 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-07-23 15:15:22,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:15:22,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 15:15:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:22,479 INFO L225 Difference]: With dead ends: 49 [2018-07-23 15:15:22,479 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 15:15:22,486 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 15:15:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-07-23 15:15:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 15:15:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-07-23 15:15:22,536 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-07-23 15:15:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:22,536 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-07-23 15:15:22,536 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:15:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-07-23 15:15:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 15:15:22,537 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:22,537 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-23 15:15:22,538 INFO L414 AbstractCegarLoop]: === Iteration 2 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-07-23 15:15:22,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:22,585 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:22,586 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:15:22,588 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:15:22,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:15:22,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:15:22,589 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-07-23 15:15:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:22,757 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-07-23 15:15:22,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:15:22,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 15:15:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:22,760 INFO L225 Difference]: With dead ends: 57 [2018-07-23 15:15:22,760 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 15:15:22,761 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:15:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 15:15:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-07-23 15:15:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 15:15:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-07-23 15:15:22,775 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-07-23 15:15:22,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:22,776 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-07-23 15:15:22,776 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:15:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-07-23 15:15:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 15:15:22,777 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:22,777 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:22,777 INFO L414 AbstractCegarLoop]: === Iteration 3 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-07-23 15:15:22,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:22,848 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:22,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-23 15:15:22,849 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:22,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:22,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:22,850 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-07-23 15:15:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:23,158 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-07-23 15:15:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:23,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 15:15:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:23,160 INFO L225 Difference]: With dead ends: 84 [2018-07-23 15:15:23,160 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 15:15:23,161 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 15:15:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-07-23 15:15:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 15:15:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-07-23 15:15:23,193 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-07-23 15:15:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:23,194 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-07-23 15:15:23,194 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-07-23 15:15:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 15:15:23,195 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:23,195 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-07-23 15:15:23,195 INFO L414 AbstractCegarLoop]: === Iteration 4 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-07-23 15:15:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:23,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:23,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:15:23,255 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:23,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:23,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:23,256 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2018-07-23 15:15:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:23,438 INFO L93 Difference]: Finished difference Result 102 states and 180 transitions. [2018-07-23 15:15:23,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:23,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 15:15:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:23,440 INFO L225 Difference]: With dead ends: 102 [2018-07-23 15:15:23,440 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 15:15:23,441 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 15:15:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2018-07-23 15:15:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:15:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 111 transitions. [2018-07-23 15:15:23,468 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 111 transitions. Word has length 7 [2018-07-23 15:15:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:23,470 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 111 transitions. [2018-07-23 15:15:23,471 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 111 transitions. [2018-07-23 15:15:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 15:15:23,472 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:23,472 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:23,473 INFO L414 AbstractCegarLoop]: === Iteration 5 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-07-23 15:15:23,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:23,515 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:23,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:23,516 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:23,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:23,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:23,517 INFO L87 Difference]: Start difference. First operand 65 states and 111 transitions. Second operand 9 states. [2018-07-23 15:15:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:23,746 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2018-07-23 15:15:23,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:23,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 15:15:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:23,748 INFO L225 Difference]: With dead ends: 113 [2018-07-23 15:15:23,749 INFO L226 Difference]: Without dead ends: 112 [2018-07-23 15:15:23,750 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:15:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-23 15:15:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2018-07-23 15:15:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 15:15:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2018-07-23 15:15:23,785 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 9 [2018-07-23 15:15:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:23,786 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2018-07-23 15:15:23,786 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-07-23 15:15:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 15:15:23,788 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:23,788 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:23,788 INFO L414 AbstractCegarLoop]: === Iteration 6 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1999237099, now seen corresponding path program 1 times [2018-07-23 15:15:23,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:23,841 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:23,841 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:23,842 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:23,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:23,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:23,844 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand 9 states. [2018-07-23 15:15:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:24,166 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2018-07-23 15:15:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:15:24,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 15:15:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:24,168 INFO L225 Difference]: With dead ends: 133 [2018-07-23 15:15:24,168 INFO L226 Difference]: Without dead ends: 132 [2018-07-23 15:15:24,169 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:15:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-23 15:15:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-07-23 15:15:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 15:15:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 145 transitions. [2018-07-23 15:15:24,196 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 145 transitions. Word has length 9 [2018-07-23 15:15:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:24,197 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 145 transitions. [2018-07-23 15:15:24,197 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 145 transitions. [2018-07-23 15:15:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 15:15:24,199 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:24,199 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-07-23 15:15:24,199 INFO L414 AbstractCegarLoop]: === Iteration 7 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313901, now seen corresponding path program 2 times [2018-07-23 15:15:24,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 15:15:24,217 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:24,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:15:24,219 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:15:24,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:15:24,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:15:24,221 INFO L87 Difference]: Start difference. First operand 83 states and 145 transitions. Second operand 4 states. [2018-07-23 15:15:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:24,250 INFO L93 Difference]: Finished difference Result 119 states and 205 transitions. [2018-07-23 15:15:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:15:24,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-07-23 15:15:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:24,251 INFO L225 Difference]: With dead ends: 119 [2018-07-23 15:15:24,251 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 15:15:24,252 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:15:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 15:15:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 15:15:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 15:15:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2018-07-23 15:15:24,287 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 9 [2018-07-23 15:15:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:24,287 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2018-07-23 15:15:24,287 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:15:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2018-07-23 15:15:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 15:15:24,290 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:24,291 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-07-23 15:15:24,291 INFO L414 AbstractCegarLoop]: === Iteration 8 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -855455763, now seen corresponding path program 1 times [2018-07-23 15:15:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 15:15:24,307 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:24,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:15:24,308 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:15:24,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:15:24,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:15:24,309 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand 4 states. [2018-07-23 15:15:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:24,339 INFO L93 Difference]: Finished difference Result 111 states and 178 transitions. [2018-07-23 15:15:24,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:15:24,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-07-23 15:15:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:24,340 INFO L225 Difference]: With dead ends: 111 [2018-07-23 15:15:24,340 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 15:15:24,341 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:15:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 15:15:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 15:15:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:15:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2018-07-23 15:15:24,364 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 9 [2018-07-23 15:15:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:24,365 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2018-07-23 15:15:24,365 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:15:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2018-07-23 15:15:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:24,369 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:24,369 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:24,370 INFO L414 AbstractCegarLoop]: === Iteration 9 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-07-23 15:15:24,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:24,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:24,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:24,430 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:24,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:24,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:24,431 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 8 states. [2018-07-23 15:15:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:24,590 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2018-07-23 15:15:24,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:24,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:24,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:24,591 INFO L225 Difference]: With dead ends: 97 [2018-07-23 15:15:24,592 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 15:15:24,592 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 15:15:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2018-07-23 15:15:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 15:15:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2018-07-23 15:15:24,627 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 10 [2018-07-23 15:15:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:24,628 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2018-07-23 15:15:24,628 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2018-07-23 15:15:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:24,629 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:24,630 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:24,630 INFO L414 AbstractCegarLoop]: === Iteration 10 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:24,633 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-07-23 15:15:24,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:24,672 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:24,672 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 15:15:24,673 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:24,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:24,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:24,674 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand 8 states. [2018-07-23 15:15:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:24,821 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2018-07-23 15:15:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:15:24,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:24,823 INFO L225 Difference]: With dead ends: 104 [2018-07-23 15:15:24,823 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 15:15:24,829 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:15:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 15:15:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2018-07-23 15:15:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 15:15:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2018-07-23 15:15:24,856 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 10 [2018-07-23 15:15:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:24,857 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2018-07-23 15:15:24,857 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2018-07-23 15:15:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:24,858 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:24,859 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:24,859 INFO L414 AbstractCegarLoop]: === Iteration 11 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-07-23 15:15:24,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:24,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:24,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:24,898 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:24,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:24,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:24,899 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand 8 states. [2018-07-23 15:15:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:24,980 INFO L93 Difference]: Finished difference Result 91 states and 143 transitions. [2018-07-23 15:15:24,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:15:24,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:24,982 INFO L225 Difference]: With dead ends: 91 [2018-07-23 15:15:24,982 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 15:15:24,983 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:24,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 15:15:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-07-23 15:15:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 15:15:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2018-07-23 15:15:25,011 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 10 [2018-07-23 15:15:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:25,011 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2018-07-23 15:15:25,011 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2018-07-23 15:15:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:25,012 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:25,012 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:25,013 INFO L414 AbstractCegarLoop]: === Iteration 12 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-07-23 15:15:25,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:25,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:25,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:25,035 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:25,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:25,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:25,036 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand 7 states. [2018-07-23 15:15:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:25,159 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2018-07-23 15:15:25,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:25,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 15:15:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:25,161 INFO L225 Difference]: With dead ends: 108 [2018-07-23 15:15:25,161 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 15:15:25,162 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:15:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 15:15:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-07-23 15:15:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 15:15:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2018-07-23 15:15:25,194 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 10 [2018-07-23 15:15:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:25,194 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2018-07-23 15:15:25,194 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2018-07-23 15:15:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:25,195 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:25,195 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:25,195 INFO L414 AbstractCegarLoop]: === Iteration 13 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-07-23 15:15:25,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:25,231 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:25,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:25,232 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:25,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:25,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:25,233 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand 8 states. [2018-07-23 15:15:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:25,378 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-07-23 15:15:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:25,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:25,380 INFO L225 Difference]: With dead ends: 116 [2018-07-23 15:15:25,380 INFO L226 Difference]: Without dead ends: 115 [2018-07-23 15:15:25,381 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:15:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-23 15:15:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2018-07-23 15:15:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 15:15:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-07-23 15:15:25,413 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-07-23 15:15:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:25,413 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-07-23 15:15:25,413 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-07-23 15:15:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:25,414 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:25,414 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:25,414 INFO L414 AbstractCegarLoop]: === Iteration 14 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-07-23 15:15:25,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:25,441 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:25,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 15:15:25,441 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:25,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:25,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:25,442 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-07-23 15:15:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:25,588 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-07-23 15:15:25,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:25,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:25,596 INFO L225 Difference]: With dead ends: 116 [2018-07-23 15:15:25,597 INFO L226 Difference]: Without dead ends: 114 [2018-07-23 15:15:25,598 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:15:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-23 15:15:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2018-07-23 15:15:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 15:15:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-07-23 15:15:25,629 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-07-23 15:15:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:25,630 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-07-23 15:15:25,630 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-07-23 15:15:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:25,631 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:25,631 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:25,631 INFO L414 AbstractCegarLoop]: === Iteration 15 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:25,632 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-07-23 15:15:25,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:25,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:25,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:25,677 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:25,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:25,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:25,678 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-07-23 15:15:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:25,815 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-07-23 15:15:25,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:25,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:25,817 INFO L225 Difference]: With dead ends: 124 [2018-07-23 15:15:25,817 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 15:15:25,818 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:15:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 15:15:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2018-07-23 15:15:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 15:15:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-07-23 15:15:25,854 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 10 [2018-07-23 15:15:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:25,854 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-07-23 15:15:25,854 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-07-23 15:15:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:25,855 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:25,855 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:25,856 INFO L414 AbstractCegarLoop]: === Iteration 16 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:25,856 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-07-23 15:15:25,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:25,880 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:25,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 15:15:25,881 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:25,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:25,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:25,885 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 8 states. [2018-07-23 15:15:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:26,032 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-07-23 15:15:26,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:26,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:26,034 INFO L225 Difference]: With dead ends: 124 [2018-07-23 15:15:26,034 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 15:15:26,035 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:15:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 15:15:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-07-23 15:15:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-23 15:15:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 172 transitions. [2018-07-23 15:15:26,075 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 172 transitions. Word has length 10 [2018-07-23 15:15:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:26,076 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 172 transitions. [2018-07-23 15:15:26,076 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 172 transitions. [2018-07-23 15:15:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:26,077 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:26,077 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:26,077 INFO L414 AbstractCegarLoop]: === Iteration 17 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-07-23 15:15:26,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:26,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:26,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:26,093 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:26,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:26,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:26,095 INFO L87 Difference]: Start difference. First operand 108 states and 172 transitions. Second operand 7 states. [2018-07-23 15:15:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:26,227 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2018-07-23 15:15:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:26,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-23 15:15:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:26,229 INFO L225 Difference]: With dead ends: 129 [2018-07-23 15:15:26,229 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 15:15:26,229 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:15:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 15:15:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-07-23 15:15:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 15:15:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2018-07-23 15:15:26,273 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 10 [2018-07-23 15:15:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:26,273 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2018-07-23 15:15:26,273 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2018-07-23 15:15:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:26,274 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:26,276 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:26,276 INFO L414 AbstractCegarLoop]: === Iteration 18 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-07-23 15:15:26,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:26,297 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:26,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:26,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:26,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:26,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:26,299 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand 8 states. [2018-07-23 15:15:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:26,398 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2018-07-23 15:15:26,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:15:26,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:26,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:26,399 INFO L225 Difference]: With dead ends: 129 [2018-07-23 15:15:26,400 INFO L226 Difference]: Without dead ends: 128 [2018-07-23 15:15:26,400 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-23 15:15:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2018-07-23 15:15:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 15:15:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 193 transitions. [2018-07-23 15:15:26,487 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 193 transitions. Word has length 10 [2018-07-23 15:15:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:26,487 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 193 transitions. [2018-07-23 15:15:26,488 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2018-07-23 15:15:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:26,488 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:26,489 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:26,489 INFO L414 AbstractCegarLoop]: === Iteration 19 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-07-23 15:15:26,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:26,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:26,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:26,514 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:26,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:26,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:26,516 INFO L87 Difference]: Start difference. First operand 121 states and 193 transitions. Second operand 8 states. [2018-07-23 15:15:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:26,652 INFO L93 Difference]: Finished difference Result 137 states and 209 transitions. [2018-07-23 15:15:26,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:26,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:26,654 INFO L225 Difference]: With dead ends: 137 [2018-07-23 15:15:26,654 INFO L226 Difference]: Without dead ends: 136 [2018-07-23 15:15:26,655 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-23 15:15:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2018-07-23 15:15:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 15:15:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-07-23 15:15:26,696 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-07-23 15:15:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:26,696 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-07-23 15:15:26,697 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-07-23 15:15:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:15:26,697 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:26,697 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:26,698 INFO L414 AbstractCegarLoop]: === Iteration 20 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:26,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-07-23 15:15:26,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:26,720 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:26,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-23 15:15:26,720 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:26,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:26,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:26,721 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 8 states. [2018-07-23 15:15:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:26,853 INFO L93 Difference]: Finished difference Result 147 states and 223 transitions. [2018-07-23 15:15:26,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:15:26,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-23 15:15:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:26,855 INFO L225 Difference]: With dead ends: 147 [2018-07-23 15:15:26,855 INFO L226 Difference]: Without dead ends: 145 [2018-07-23 15:15:26,856 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:15:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-23 15:15:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-07-23 15:15:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 15:15:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-07-23 15:15:26,896 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-07-23 15:15:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:26,897 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-07-23 15:15:26,897 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-07-23 15:15:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:15:26,897 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:26,898 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:26,898 INFO L414 AbstractCegarLoop]: === Iteration 21 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-07-23 15:15:26,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:26,928 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:26,928 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:26,929 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:26,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:26,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:26,930 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 10 states. [2018-07-23 15:15:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:27,131 INFO L93 Difference]: Finished difference Result 151 states and 226 transitions. [2018-07-23 15:15:27,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:15:27,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-23 15:15:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:27,133 INFO L225 Difference]: With dead ends: 151 [2018-07-23 15:15:27,134 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 15:15:27,134 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:15:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 15:15:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-07-23 15:15:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 15:15:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 192 transitions. [2018-07-23 15:15:27,176 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 192 transitions. Word has length 12 [2018-07-23 15:15:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:27,176 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 192 transitions. [2018-07-23 15:15:27,176 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 192 transitions. [2018-07-23 15:15:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:15:27,177 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:27,177 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:27,178 INFO L414 AbstractCegarLoop]: === Iteration 22 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:27,178 INFO L82 PathProgramCache]: Analyzing trace with hash 447688542, now seen corresponding path program 1 times [2018-07-23 15:15:27,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:27,207 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:15:27,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-07-23 15:15:27,208 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:27,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:27,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:27,209 INFO L87 Difference]: Start difference. First operand 121 states and 192 transitions. Second operand 10 states. [2018-07-23 15:15:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:27,368 INFO L93 Difference]: Finished difference Result 149 states and 233 transitions. [2018-07-23 15:15:27,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:27,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-23 15:15:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:27,372 INFO L225 Difference]: With dead ends: 149 [2018-07-23 15:15:27,372 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 15:15:27,373 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:15:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 15:15:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-07-23 15:15:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-23 15:15:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 216 transitions. [2018-07-23 15:15:27,424 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 216 transitions. Word has length 12 [2018-07-23 15:15:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:27,425 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 216 transitions. [2018-07-23 15:15:27,425 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 216 transitions. [2018-07-23 15:15:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:15:27,426 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:27,426 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:27,428 INFO L414 AbstractCegarLoop]: === Iteration 23 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1316178012, now seen corresponding path program 1 times [2018-07-23 15:15:27,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:27,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:27,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:27,450 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:27,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:27,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:27,451 INFO L87 Difference]: Start difference. First operand 136 states and 216 transitions. Second operand 9 states. [2018-07-23 15:15:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:27,571 INFO L93 Difference]: Finished difference Result 145 states and 230 transitions. [2018-07-23 15:15:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:27,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-23 15:15:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:27,573 INFO L225 Difference]: With dead ends: 145 [2018-07-23 15:15:27,573 INFO L226 Difference]: Without dead ends: 144 [2018-07-23 15:15:27,574 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:15:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-23 15:15:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-23 15:15:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-23 15:15:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2018-07-23 15:15:27,625 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 12 [2018-07-23 15:15:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:27,625 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2018-07-23 15:15:27,625 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2018-07-23 15:15:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:15:27,626 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:27,626 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:27,626 INFO L414 AbstractCegarLoop]: === Iteration 24 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-07-23 15:15:27,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:27,655 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:27,655 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:27,655 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:27,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:27,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:27,656 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand 10 states. [2018-07-23 15:15:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:27,871 INFO L93 Difference]: Finished difference Result 168 states and 253 transitions. [2018-07-23 15:15:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:15:27,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-23 15:15:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:27,873 INFO L225 Difference]: With dead ends: 168 [2018-07-23 15:15:27,873 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 15:15:27,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:15:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 15:15:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-07-23 15:15:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 15:15:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2018-07-23 15:15:27,925 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 217 transitions. Word has length 12 [2018-07-23 15:15:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:27,926 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 217 transitions. [2018-07-23 15:15:27,926 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 217 transitions. [2018-07-23 15:15:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:27,927 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:27,927 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:27,927 INFO L414 AbstractCegarLoop]: === Iteration 25 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1139034733, now seen corresponding path program 1 times [2018-07-23 15:15:27,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:27,945 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:27,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:27,945 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:27,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:27,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:27,946 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. Second operand 9 states. [2018-07-23 15:15:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:28,076 INFO L93 Difference]: Finished difference Result 164 states and 254 transitions. [2018-07-23 15:15:28,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:28,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:28,077 INFO L225 Difference]: With dead ends: 164 [2018-07-23 15:15:28,077 INFO L226 Difference]: Without dead ends: 163 [2018-07-23 15:15:28,078 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-23 15:15:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-07-23 15:15:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 15:15:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 241 transitions. [2018-07-23 15:15:28,143 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 241 transitions. Word has length 13 [2018-07-23 15:15:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:28,143 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 241 transitions. [2018-07-23 15:15:28,143 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 241 transitions. [2018-07-23 15:15:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:28,144 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:28,144 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:28,144 INFO L414 AbstractCegarLoop]: === Iteration 26 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:28,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-07-23 15:15:28,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:28,164 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:28,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:28,165 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:28,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:28,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:28,166 INFO L87 Difference]: Start difference. First operand 151 states and 241 transitions. Second operand 9 states. [2018-07-23 15:15:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:28,389 INFO L93 Difference]: Finished difference Result 217 states and 338 transitions. [2018-07-23 15:15:28,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:15:28,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:28,391 INFO L225 Difference]: With dead ends: 217 [2018-07-23 15:15:28,391 INFO L226 Difference]: Without dead ends: 215 [2018-07-23 15:15:28,392 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:15:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-23 15:15:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2018-07-23 15:15:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-23 15:15:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 260 transitions. [2018-07-23 15:15:28,461 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 260 transitions. Word has length 13 [2018-07-23 15:15:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:28,461 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 260 transitions. [2018-07-23 15:15:28,461 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 260 transitions. [2018-07-23 15:15:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:28,462 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:28,462 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:28,465 INFO L414 AbstractCegarLoop]: === Iteration 27 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash -86604803, now seen corresponding path program 1 times [2018-07-23 15:15:28,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:28,492 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:28,492 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:28,492 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:28,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:28,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:28,493 INFO L87 Difference]: Start difference. First operand 163 states and 260 transitions. Second operand 9 states. [2018-07-23 15:15:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:28,702 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2018-07-23 15:15:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:28,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:28,704 INFO L225 Difference]: With dead ends: 208 [2018-07-23 15:15:28,704 INFO L226 Difference]: Without dead ends: 207 [2018-07-23 15:15:28,705 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:15:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-23 15:15:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2018-07-23 15:15:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 15:15:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2018-07-23 15:15:28,776 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 277 transitions. Word has length 13 [2018-07-23 15:15:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:28,776 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 277 transitions. [2018-07-23 15:15:28,776 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 277 transitions. [2018-07-23 15:15:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:28,777 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:28,778 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:28,778 INFO L414 AbstractCegarLoop]: === Iteration 28 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:28,778 INFO L82 PathProgramCache]: Analyzing trace with hash -86605091, now seen corresponding path program 1 times [2018-07-23 15:15:28,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:28,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:28,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:28,793 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:28,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:28,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:28,794 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. Second operand 7 states. [2018-07-23 15:15:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:28,956 INFO L93 Difference]: Finished difference Result 229 states and 357 transitions. [2018-07-23 15:15:28,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:28,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 15:15:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:28,958 INFO L225 Difference]: With dead ends: 229 [2018-07-23 15:15:28,958 INFO L226 Difference]: Without dead ends: 227 [2018-07-23 15:15:28,959 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-23 15:15:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2018-07-23 15:15:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 15:15:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 329 transitions. [2018-07-23 15:15:29,041 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 329 transitions. Word has length 13 [2018-07-23 15:15:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:29,042 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 329 transitions. [2018-07-23 15:15:29,042 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 329 transitions. [2018-07-23 15:15:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:29,043 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:29,043 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:29,045 INFO L414 AbstractCegarLoop]: === Iteration 29 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-07-23 15:15:29,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:29,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:29,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:29,069 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:29,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:29,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:29,070 INFO L87 Difference]: Start difference. First operand 203 states and 329 transitions. Second operand 8 states. [2018-07-23 15:15:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:29,325 INFO L93 Difference]: Finished difference Result 254 states and 401 transitions. [2018-07-23 15:15:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:15:29,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-23 15:15:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:29,328 INFO L225 Difference]: With dead ends: 254 [2018-07-23 15:15:29,328 INFO L226 Difference]: Without dead ends: 252 [2018-07-23 15:15:29,329 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-07-23 15:15:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 206. [2018-07-23 15:15:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-23 15:15:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 334 transitions. [2018-07-23 15:15:29,429 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 334 transitions. Word has length 13 [2018-07-23 15:15:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:29,429 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 334 transitions. [2018-07-23 15:15:29,429 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 334 transitions. [2018-07-23 15:15:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:29,430 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:29,430 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:29,431 INFO L414 AbstractCegarLoop]: === Iteration 30 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298927, now seen corresponding path program 2 times [2018-07-23 15:15:29,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:29,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:29,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:29,451 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:29,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:29,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:29,452 INFO L87 Difference]: Start difference. First operand 206 states and 334 transitions. Second operand 9 states. [2018-07-23 15:15:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:29,648 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2018-07-23 15:15:29,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:29,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:29,650 INFO L225 Difference]: With dead ends: 220 [2018-07-23 15:15:29,650 INFO L226 Difference]: Without dead ends: 219 [2018-07-23 15:15:29,651 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-23 15:15:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2018-07-23 15:15:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 15:15:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 328 transitions. [2018-07-23 15:15:29,732 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 328 transitions. Word has length 13 [2018-07-23 15:15:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:29,732 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 328 transitions. [2018-07-23 15:15:29,733 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 328 transitions. [2018-07-23 15:15:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:29,733 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:29,734 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:29,734 INFO L414 AbstractCegarLoop]: === Iteration 31 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 2 times [2018-07-23 15:15:29,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:29,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:29,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:29,746 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:29,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:29,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:29,747 INFO L87 Difference]: Start difference. First operand 203 states and 328 transitions. Second operand 7 states. [2018-07-23 15:15:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:29,914 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2018-07-23 15:15:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:29,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 15:15:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:29,916 INFO L225 Difference]: With dead ends: 227 [2018-07-23 15:15:29,916 INFO L226 Difference]: Without dead ends: 225 [2018-07-23 15:15:29,917 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:15:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-23 15:15:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2018-07-23 15:15:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 15:15:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 323 transitions. [2018-07-23 15:15:29,994 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 323 transitions. Word has length 13 [2018-07-23 15:15:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:29,995 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 323 transitions. [2018-07-23 15:15:29,995 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 323 transitions. [2018-07-23 15:15:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:29,996 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:29,996 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:29,996 INFO L414 AbstractCegarLoop]: === Iteration 32 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-07-23 15:15:29,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:30,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:30,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:30,015 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:30,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:30,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:30,016 INFO L87 Difference]: Start difference. First operand 201 states and 323 transitions. Second operand 9 states. [2018-07-23 15:15:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:30,263 INFO L93 Difference]: Finished difference Result 244 states and 382 transitions. [2018-07-23 15:15:30,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:15:30,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:30,265 INFO L225 Difference]: With dead ends: 244 [2018-07-23 15:15:30,266 INFO L226 Difference]: Without dead ends: 242 [2018-07-23 15:15:30,266 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:15:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-23 15:15:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 198. [2018-07-23 15:15:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-23 15:15:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 318 transitions. [2018-07-23 15:15:30,342 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 318 transitions. Word has length 13 [2018-07-23 15:15:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:30,345 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 318 transitions. [2018-07-23 15:15:30,345 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 318 transitions. [2018-07-23 15:15:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:30,346 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:30,346 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:30,346 INFO L414 AbstractCegarLoop]: === Iteration 33 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-07-23 15:15:30,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:30,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:30,362 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:30,363 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:30,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:30,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:30,363 INFO L87 Difference]: Start difference. First operand 198 states and 318 transitions. Second operand 7 states. [2018-07-23 15:15:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:30,541 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2018-07-23 15:15:30,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:30,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 15:15:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:30,543 INFO L225 Difference]: With dead ends: 222 [2018-07-23 15:15:30,543 INFO L226 Difference]: Without dead ends: 220 [2018-07-23 15:15:30,544 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:15:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-23 15:15:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 194. [2018-07-23 15:15:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 15:15:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 311 transitions. [2018-07-23 15:15:30,630 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 311 transitions. Word has length 13 [2018-07-23 15:15:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:30,630 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 311 transitions. [2018-07-23 15:15:30,630 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 311 transitions. [2018-07-23 15:15:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:30,631 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:30,631 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:30,632 INFO L414 AbstractCegarLoop]: === Iteration 34 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash 267373789, now seen corresponding path program 1 times [2018-07-23 15:15:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:30,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:30,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:30,654 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:30,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:30,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:30,655 INFO L87 Difference]: Start difference. First operand 194 states and 311 transitions. Second operand 9 states. [2018-07-23 15:15:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:30,805 INFO L93 Difference]: Finished difference Result 219 states and 343 transitions. [2018-07-23 15:15:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:30,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:30,807 INFO L225 Difference]: With dead ends: 219 [2018-07-23 15:15:30,807 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 15:15:30,807 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 15:15:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2018-07-23 15:15:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-23 15:15:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 322 transitions. [2018-07-23 15:15:30,889 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 322 transitions. Word has length 13 [2018-07-23 15:15:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:30,890 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 322 transitions. [2018-07-23 15:15:30,890 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 322 transitions. [2018-07-23 15:15:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:30,891 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:30,891 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:30,891 INFO L414 AbstractCegarLoop]: === Iteration 35 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-07-23 15:15:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:30,913 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:30,913 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:30,913 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:30,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:30,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:30,914 INFO L87 Difference]: Start difference. First operand 200 states and 322 transitions. Second operand 9 states. [2018-07-23 15:15:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:31,155 INFO L93 Difference]: Finished difference Result 251 states and 394 transitions. [2018-07-23 15:15:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:15:31,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:31,157 INFO L225 Difference]: With dead ends: 251 [2018-07-23 15:15:31,158 INFO L226 Difference]: Without dead ends: 249 [2018-07-23 15:15:31,158 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:15:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-23 15:15:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2018-07-23 15:15:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-23 15:15:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 345 transitions. [2018-07-23 15:15:31,246 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 345 transitions. Word has length 13 [2018-07-23 15:15:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:31,247 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 345 transitions. [2018-07-23 15:15:31,247 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 345 transitions. [2018-07-23 15:15:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:31,248 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:31,248 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:31,248 INFO L414 AbstractCegarLoop]: === Iteration 36 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:31,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277807, now seen corresponding path program 2 times [2018-07-23 15:15:31,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:31,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:31,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:15:31,268 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:15:31,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:15:31,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:15:31,268 INFO L87 Difference]: Start difference. First operand 214 states and 345 transitions. Second operand 7 states. [2018-07-23 15:15:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:31,441 INFO L93 Difference]: Finished difference Result 258 states and 407 transitions. [2018-07-23 15:15:31,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:15:31,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 15:15:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:31,443 INFO L225 Difference]: With dead ends: 258 [2018-07-23 15:15:31,443 INFO L226 Difference]: Without dead ends: 256 [2018-07-23 15:15:31,443 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-23 15:15:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2018-07-23 15:15:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-23 15:15:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 382 transitions. [2018-07-23 15:15:31,538 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 382 transitions. Word has length 13 [2018-07-23 15:15:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:31,538 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 382 transitions. [2018-07-23 15:15:31,538 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:15:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 382 transitions. [2018-07-23 15:15:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:31,539 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:31,539 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:31,539 INFO L414 AbstractCegarLoop]: === Iteration 37 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277519, now seen corresponding path program 2 times [2018-07-23 15:15:31,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:31,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:31,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:31,557 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:31,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:31,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:31,558 INFO L87 Difference]: Start difference. First operand 236 states and 382 transitions. Second operand 9 states. [2018-07-23 15:15:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:31,799 INFO L93 Difference]: Finished difference Result 270 states and 424 transitions. [2018-07-23 15:15:31,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:31,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:31,802 INFO L225 Difference]: With dead ends: 270 [2018-07-23 15:15:31,802 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 15:15:31,802 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:15:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 15:15:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 241. [2018-07-23 15:15:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-23 15:15:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 391 transitions. [2018-07-23 15:15:31,899 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 391 transitions. Word has length 13 [2018-07-23 15:15:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:31,899 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 391 transitions. [2018-07-23 15:15:31,899 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 391 transitions. [2018-07-23 15:15:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:31,900 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:31,900 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:31,900 INFO L414 AbstractCegarLoop]: === Iteration 38 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-07-23 15:15:31,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:31,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:31,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:31,916 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:31,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:31,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:31,917 INFO L87 Difference]: Start difference. First operand 241 states and 391 transitions. Second operand 8 states. [2018-07-23 15:15:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:32,152 INFO L93 Difference]: Finished difference Result 296 states and 468 transitions. [2018-07-23 15:15:32,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:15:32,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-23 15:15:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:32,154 INFO L225 Difference]: With dead ends: 296 [2018-07-23 15:15:32,154 INFO L226 Difference]: Without dead ends: 294 [2018-07-23 15:15:32,155 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-23 15:15:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 245. [2018-07-23 15:15:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 15:15:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 397 transitions. [2018-07-23 15:15:32,286 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 397 transitions. Word has length 13 [2018-07-23 15:15:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:32,287 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 397 transitions. [2018-07-23 15:15:32,287 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 397 transitions. [2018-07-23 15:15:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:32,288 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:32,288 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:32,288 INFO L414 AbstractCegarLoop]: === Iteration 39 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:32,289 INFO L82 PathProgramCache]: Analyzing trace with hash -238445237, now seen corresponding path program 1 times [2018-07-23 15:15:32,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:32,319 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:32,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:32,320 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:32,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:32,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:32,320 INFO L87 Difference]: Start difference. First operand 245 states and 397 transitions. Second operand 9 states. [2018-07-23 15:15:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:32,528 INFO L93 Difference]: Finished difference Result 270 states and 431 transitions. [2018-07-23 15:15:32,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:32,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:32,530 INFO L225 Difference]: With dead ends: 270 [2018-07-23 15:15:32,531 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 15:15:32,531 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 15:15:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 260. [2018-07-23 15:15:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-23 15:15:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 423 transitions. [2018-07-23 15:15:32,672 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 423 transitions. Word has length 13 [2018-07-23 15:15:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:32,672 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 423 transitions. [2018-07-23 15:15:32,672 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 423 transitions. [2018-07-23 15:15:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:32,673 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:32,674 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:32,674 INFO L414 AbstractCegarLoop]: === Iteration 40 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:32,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-07-23 15:15:32,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:32,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:32,693 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:32,693 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:32,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:32,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:32,694 INFO L87 Difference]: Start difference. First operand 260 states and 423 transitions. Second operand 9 states. [2018-07-23 15:15:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:32,993 INFO L93 Difference]: Finished difference Result 317 states and 507 transitions. [2018-07-23 15:15:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:15:32,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:32,996 INFO L225 Difference]: With dead ends: 317 [2018-07-23 15:15:32,996 INFO L226 Difference]: Without dead ends: 315 [2018-07-23 15:15:32,997 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:15:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-23 15:15:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 252. [2018-07-23 15:15:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-07-23 15:15:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 411 transitions. [2018-07-23 15:15:33,117 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 411 transitions. Word has length 13 [2018-07-23 15:15:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:33,117 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 411 transitions. [2018-07-23 15:15:33,117 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 411 transitions. [2018-07-23 15:15:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 15:15:33,118 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:33,118 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 15:15:33,119 INFO L414 AbstractCegarLoop]: === Iteration 41 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash -24071906, now seen corresponding path program 1 times [2018-07-23 15:15:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:33,138 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:33,138 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:33,138 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:33,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:33,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:33,139 INFO L87 Difference]: Start difference. First operand 252 states and 411 transitions. Second operand 9 states. [2018-07-23 15:15:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:33,383 INFO L93 Difference]: Finished difference Result 317 states and 513 transitions. [2018-07-23 15:15:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:15:33,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-23 15:15:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:33,385 INFO L225 Difference]: With dead ends: 317 [2018-07-23 15:15:33,385 INFO L226 Difference]: Without dead ends: 315 [2018-07-23 15:15:33,386 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:15:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-23 15:15:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2018-07-23 15:15:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-07-23 15:15:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 423 transitions. [2018-07-23 15:15:33,499 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 423 transitions. Word has length 13 [2018-07-23 15:15:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:33,500 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 423 transitions. [2018-07-23 15:15:33,500 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 423 transitions. [2018-07-23 15:15:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:33,501 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:33,501 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:33,501 INFO L414 AbstractCegarLoop]: === Iteration 42 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash -603538094, now seen corresponding path program 1 times [2018-07-23 15:15:33,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:33,530 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:33,531 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:33,531 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:33,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:33,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:33,531 INFO L87 Difference]: Start difference. First operand 258 states and 423 transitions. Second operand 11 states. [2018-07-23 15:15:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:33,752 INFO L93 Difference]: Finished difference Result 273 states and 437 transitions. [2018-07-23 15:15:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:15:33,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:33,754 INFO L225 Difference]: With dead ends: 273 [2018-07-23 15:15:33,754 INFO L226 Difference]: Without dead ends: 272 [2018-07-23 15:15:33,754 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:15:33,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-07-23 15:15:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 249. [2018-07-23 15:15:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-23 15:15:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 408 transitions. [2018-07-23 15:15:33,869 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 408 transitions. Word has length 15 [2018-07-23 15:15:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:33,870 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 408 transitions. [2018-07-23 15:15:33,870 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 408 transitions. [2018-07-23 15:15:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:33,871 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:33,871 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:33,871 INFO L414 AbstractCegarLoop]: === Iteration 43 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2021827592, now seen corresponding path program 1 times [2018-07-23 15:15:33,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:33,890 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:33,890 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:33,890 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:33,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:33,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:33,891 INFO L87 Difference]: Start difference. First operand 249 states and 408 transitions. Second operand 11 states. [2018-07-23 15:15:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:34,104 INFO L93 Difference]: Finished difference Result 279 states and 448 transitions. [2018-07-23 15:15:34,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:34,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:34,106 INFO L225 Difference]: With dead ends: 279 [2018-07-23 15:15:34,106 INFO L226 Difference]: Without dead ends: 278 [2018-07-23 15:15:34,107 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:15:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-23 15:15:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 255. [2018-07-23 15:15:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-23 15:15:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 418 transitions. [2018-07-23 15:15:34,227 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 418 transitions. Word has length 15 [2018-07-23 15:15:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:34,228 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 418 transitions. [2018-07-23 15:15:34,228 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 418 transitions. [2018-07-23 15:15:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:34,229 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:34,229 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:34,229 INFO L414 AbstractCegarLoop]: === Iteration 44 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2013238847, now seen corresponding path program 1 times [2018-07-23 15:15:34,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:34,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:34,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:34,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:34,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:34,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:34,247 INFO L87 Difference]: Start difference. First operand 255 states and 418 transitions. Second operand 9 states. [2018-07-23 15:15:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:34,465 INFO L93 Difference]: Finished difference Result 296 states and 483 transitions. [2018-07-23 15:15:34,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:15:34,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-23 15:15:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:34,467 INFO L225 Difference]: With dead ends: 296 [2018-07-23 15:15:34,467 INFO L226 Difference]: Without dead ends: 295 [2018-07-23 15:15:34,468 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:15:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-23 15:15:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 246. [2018-07-23 15:15:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-23 15:15:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 403 transitions. [2018-07-23 15:15:34,581 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 403 transitions. Word has length 15 [2018-07-23 15:15:34,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:34,581 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 403 transitions. [2018-07-23 15:15:34,581 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 403 transitions. [2018-07-23 15:15:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:34,582 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:34,582 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:34,583 INFO L414 AbstractCegarLoop]: === Iteration 45 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:34,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1215990847, now seen corresponding path program 1 times [2018-07-23 15:15:34,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:34,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:34,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:34,605 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:34,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:34,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:34,605 INFO L87 Difference]: Start difference. First operand 246 states and 403 transitions. Second operand 11 states. [2018-07-23 15:15:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:34,817 INFO L93 Difference]: Finished difference Result 274 states and 449 transitions. [2018-07-23 15:15:34,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:34,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:34,819 INFO L225 Difference]: With dead ends: 274 [2018-07-23 15:15:34,819 INFO L226 Difference]: Without dead ends: 273 [2018-07-23 15:15:34,820 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:15:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-23 15:15:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-07-23 15:15:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-23 15:15:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 438 transitions. [2018-07-23 15:15:34,952 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 438 transitions. Word has length 15 [2018-07-23 15:15:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:34,952 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 438 transitions. [2018-07-23 15:15:34,952 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 438 transitions. [2018-07-23 15:15:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:34,953 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:34,954 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:34,954 INFO L414 AbstractCegarLoop]: === Iteration 46 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:34,954 INFO L82 PathProgramCache]: Analyzing trace with hash -994782852, now seen corresponding path program 1 times [2018-07-23 15:15:34,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:34,986 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:34,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:34,986 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:34,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:34,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:34,987 INFO L87 Difference]: Start difference. First operand 267 states and 438 transitions. Second operand 11 states. [2018-07-23 15:15:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:35,272 INFO L93 Difference]: Finished difference Result 311 states and 496 transitions. [2018-07-23 15:15:35,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:15:35,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:35,274 INFO L225 Difference]: With dead ends: 311 [2018-07-23 15:15:35,274 INFO L226 Difference]: Without dead ends: 309 [2018-07-23 15:15:35,275 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:15:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-23 15:15:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 279. [2018-07-23 15:15:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-23 15:15:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 457 transitions. [2018-07-23 15:15:35,406 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 457 transitions. Word has length 15 [2018-07-23 15:15:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:35,406 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 457 transitions. [2018-07-23 15:15:35,406 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 457 transitions. [2018-07-23 15:15:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:35,407 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:35,407 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:35,408 INFO L414 AbstractCegarLoop]: === Iteration 47 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1087577094, now seen corresponding path program 2 times [2018-07-23 15:15:35,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:35,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:35,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:15:35,429 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:15:35,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:15:35,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:35,430 INFO L87 Difference]: Start difference. First operand 279 states and 457 transitions. Second operand 12 states. [2018-07-23 15:15:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:35,746 INFO L93 Difference]: Finished difference Result 313 states and 495 transitions. [2018-07-23 15:15:35,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:15:35,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-23 15:15:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:35,748 INFO L225 Difference]: With dead ends: 313 [2018-07-23 15:15:35,749 INFO L226 Difference]: Without dead ends: 312 [2018-07-23 15:15:35,749 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:15:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-07-23 15:15:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2018-07-23 15:15:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-07-23 15:15:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 466 transitions. [2018-07-23 15:15:35,909 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 466 transitions. Word has length 15 [2018-07-23 15:15:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:35,909 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 466 transitions. [2018-07-23 15:15:35,909 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:15:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 466 transitions. [2018-07-23 15:15:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:35,910 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:35,910 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:35,910 INFO L414 AbstractCegarLoop]: === Iteration 48 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1086284228, now seen corresponding path program 1 times [2018-07-23 15:15:35,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:35,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:35,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:35,935 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:35,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:35,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:35,936 INFO L87 Difference]: Start difference. First operand 284 states and 466 transitions. Second operand 11 states. [2018-07-23 15:15:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:36,401 INFO L93 Difference]: Finished difference Result 354 states and 563 transitions. [2018-07-23 15:15:36,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:15:36,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:36,403 INFO L225 Difference]: With dead ends: 354 [2018-07-23 15:15:36,403 INFO L226 Difference]: Without dead ends: 352 [2018-07-23 15:15:36,404 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:15:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-07-23 15:15:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 296. [2018-07-23 15:15:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-07-23 15:15:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 486 transitions. [2018-07-23 15:15:36,548 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 486 transitions. Word has length 15 [2018-07-23 15:15:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 486 transitions. [2018-07-23 15:15:36,548 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 486 transitions. [2018-07-23 15:15:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:36,549 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:36,549 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:36,549 INFO L414 AbstractCegarLoop]: === Iteration 49 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577631, now seen corresponding path program 1 times [2018-07-23 15:15:36,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:36,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:36,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:36,567 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:36,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:36,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:36,568 INFO L87 Difference]: Start difference. First operand 296 states and 486 transitions. Second operand 11 states. [2018-07-23 15:15:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:36,800 INFO L93 Difference]: Finished difference Result 332 states and 544 transitions. [2018-07-23 15:15:36,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:36,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:36,803 INFO L225 Difference]: With dead ends: 332 [2018-07-23 15:15:36,803 INFO L226 Difference]: Without dead ends: 331 [2018-07-23 15:15:36,804 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:15:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-23 15:15:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 318. [2018-07-23 15:15:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-07-23 15:15:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 523 transitions. [2018-07-23 15:15:36,984 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 523 transitions. Word has length 15 [2018-07-23 15:15:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:36,985 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 523 transitions. [2018-07-23 15:15:36,985 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 523 transitions. [2018-07-23 15:15:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:36,985 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:36,986 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:36,986 INFO L414 AbstractCegarLoop]: === Iteration 50 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577919, now seen corresponding path program 1 times [2018-07-23 15:15:36,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:37,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:37,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:37,004 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:37,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:37,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:37,005 INFO L87 Difference]: Start difference. First operand 318 states and 523 transitions. Second operand 10 states. [2018-07-23 15:15:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:37,492 INFO L93 Difference]: Finished difference Result 503 states and 808 transitions. [2018-07-23 15:15:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:15:37,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 15:15:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:37,495 INFO L225 Difference]: With dead ends: 503 [2018-07-23 15:15:37,495 INFO L226 Difference]: Without dead ends: 501 [2018-07-23 15:15:37,495 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:15:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-23 15:15:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 396. [2018-07-23 15:15:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-23 15:15:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 658 transitions. [2018-07-23 15:15:37,712 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 658 transitions. Word has length 15 [2018-07-23 15:15:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:37,712 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 658 transitions. [2018-07-23 15:15:37,712 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 658 transitions. [2018-07-23 15:15:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:37,713 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:37,713 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:37,713 INFO L414 AbstractCegarLoop]: === Iteration 51 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1374166088, now seen corresponding path program 1 times [2018-07-23 15:15:37,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:37,735 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:37,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:15:37,735 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:15:37,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:15:37,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:37,736 INFO L87 Difference]: Start difference. First operand 396 states and 658 transitions. Second operand 12 states. [2018-07-23 15:15:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:38,152 INFO L93 Difference]: Finished difference Result 489 states and 800 transitions. [2018-07-23 15:15:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:15:38,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-23 15:15:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:38,155 INFO L225 Difference]: With dead ends: 489 [2018-07-23 15:15:38,155 INFO L226 Difference]: Without dead ends: 488 [2018-07-23 15:15:38,156 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:15:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-07-23 15:15:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 429. [2018-07-23 15:15:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-07-23 15:15:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 718 transitions. [2018-07-23 15:15:38,354 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 718 transitions. Word has length 15 [2018-07-23 15:15:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:38,355 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 718 transitions. [2018-07-23 15:15:38,355 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:15:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 718 transitions. [2018-07-23 15:15:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:38,356 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:38,356 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:38,356 INFO L414 AbstractCegarLoop]: === Iteration 52 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-07-23 15:15:38,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:38,376 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:38,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:38,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:38,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:38,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:38,377 INFO L87 Difference]: Start difference. First operand 429 states and 718 transitions. Second operand 11 states. [2018-07-23 15:15:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:38,750 INFO L93 Difference]: Finished difference Result 484 states and 793 transitions. [2018-07-23 15:15:38,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:15:38,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:38,753 INFO L225 Difference]: With dead ends: 484 [2018-07-23 15:15:38,753 INFO L226 Difference]: Without dead ends: 482 [2018-07-23 15:15:38,754 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:15:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-07-23 15:15:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 442. [2018-07-23 15:15:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-07-23 15:15:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 739 transitions. [2018-07-23 15:15:38,970 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 739 transitions. Word has length 15 [2018-07-23 15:15:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:38,971 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 739 transitions. [2018-07-23 15:15:38,971 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 739 transitions. [2018-07-23 15:15:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:38,973 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:38,973 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:38,973 INFO L414 AbstractCegarLoop]: === Iteration 53 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash -750529310, now seen corresponding path program 1 times [2018-07-23 15:15:38,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:39,003 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:39,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:39,004 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:39,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:39,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:39,005 INFO L87 Difference]: Start difference. First operand 442 states and 739 transitions. Second operand 10 states. [2018-07-23 15:15:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:39,313 INFO L93 Difference]: Finished difference Result 465 states and 766 transitions. [2018-07-23 15:15:39,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:39,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 15:15:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:39,316 INFO L225 Difference]: With dead ends: 465 [2018-07-23 15:15:39,316 INFO L226 Difference]: Without dead ends: 464 [2018-07-23 15:15:39,317 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:15:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-07-23 15:15:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 451. [2018-07-23 15:15:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-23 15:15:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 754 transitions. [2018-07-23 15:15:39,566 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 754 transitions. Word has length 15 [2018-07-23 15:15:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:39,567 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 754 transitions. [2018-07-23 15:15:39,567 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 754 transitions. [2018-07-23 15:15:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:39,568 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:39,568 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:39,568 INFO L414 AbstractCegarLoop]: === Iteration 54 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:39,568 INFO L82 PathProgramCache]: Analyzing trace with hash -215212996, now seen corresponding path program 1 times [2018-07-23 15:15:39,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:39,585 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:39,585 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:39,586 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:39,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:39,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:39,586 INFO L87 Difference]: Start difference. First operand 451 states and 754 transitions. Second operand 10 states. [2018-07-23 15:15:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:40,032 INFO L93 Difference]: Finished difference Result 518 states and 855 transitions. [2018-07-23 15:15:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:15:40,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 15:15:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:40,036 INFO L225 Difference]: With dead ends: 518 [2018-07-23 15:15:40,036 INFO L226 Difference]: Without dead ends: 516 [2018-07-23 15:15:40,036 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:15:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-07-23 15:15:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2018-07-23 15:15:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-07-23 15:15:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 781 transitions. [2018-07-23 15:15:40,272 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 781 transitions. Word has length 15 [2018-07-23 15:15:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:40,272 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 781 transitions. [2018-07-23 15:15:40,272 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 781 transitions. [2018-07-23 15:15:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:40,273 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:40,273 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:40,273 INFO L414 AbstractCegarLoop]: === Iteration 55 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:40,273 INFO L82 PathProgramCache]: Analyzing trace with hash -494290335, now seen corresponding path program 1 times [2018-07-23 15:15:40,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:40,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:40,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:40,289 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:40,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:40,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:40,289 INFO L87 Difference]: Start difference. First operand 467 states and 781 transitions. Second operand 10 states. [2018-07-23 15:15:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:40,626 INFO L93 Difference]: Finished difference Result 513 states and 856 transitions. [2018-07-23 15:15:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:40,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 15:15:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:40,629 INFO L225 Difference]: With dead ends: 513 [2018-07-23 15:15:40,629 INFO L226 Difference]: Without dead ends: 512 [2018-07-23 15:15:40,630 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:15:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-07-23 15:15:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 492. [2018-07-23 15:15:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-07-23 15:15:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 823 transitions. [2018-07-23 15:15:40,829 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 823 transitions. Word has length 15 [2018-07-23 15:15:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:40,829 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 823 transitions. [2018-07-23 15:15:40,830 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 823 transitions. [2018-07-23 15:15:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:40,831 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:40,831 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:40,831 INFO L414 AbstractCegarLoop]: === Iteration 56 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:40,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1511388970, now seen corresponding path program 2 times [2018-07-23 15:15:40,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:40,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:40,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:40,847 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:40,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:40,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:40,848 INFO L87 Difference]: Start difference. First operand 492 states and 823 transitions. Second operand 11 states. [2018-07-23 15:15:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:41,280 INFO L93 Difference]: Finished difference Result 571 states and 939 transitions. [2018-07-23 15:15:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:15:41,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:41,283 INFO L225 Difference]: With dead ends: 571 [2018-07-23 15:15:41,284 INFO L226 Difference]: Without dead ends: 570 [2018-07-23 15:15:41,284 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:15:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-07-23 15:15:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 512. [2018-07-23 15:15:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-07-23 15:15:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 860 transitions. [2018-07-23 15:15:41,504 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 860 transitions. Word has length 15 [2018-07-23 15:15:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:41,505 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 860 transitions. [2018-07-23 15:15:41,505 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 860 transitions. [2018-07-23 15:15:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:41,506 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:41,506 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:41,506 INFO L414 AbstractCegarLoop]: === Iteration 57 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-07-23 15:15:41,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:41,521 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:41,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:41,521 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:41,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:41,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:41,522 INFO L87 Difference]: Start difference. First operand 512 states and 860 transitions. Second operand 10 states. [2018-07-23 15:15:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:41,961 INFO L93 Difference]: Finished difference Result 583 states and 963 transitions. [2018-07-23 15:15:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:15:41,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 15:15:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:41,964 INFO L225 Difference]: With dead ends: 583 [2018-07-23 15:15:41,964 INFO L226 Difference]: Without dead ends: 581 [2018-07-23 15:15:41,965 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:15:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-07-23 15:15:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 524. [2018-07-23 15:15:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-07-23 15:15:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 881 transitions. [2018-07-23 15:15:42,267 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 881 transitions. Word has length 15 [2018-07-23 15:15:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:42,268 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 881 transitions. [2018-07-23 15:15:42,268 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 881 transitions. [2018-07-23 15:15:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:42,269 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:42,269 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:42,269 INFO L414 AbstractCegarLoop]: === Iteration 58 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1502800801, now seen corresponding path program 1 times [2018-07-23 15:15:42,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:42,289 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:42,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:42,290 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:42,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:42,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:42,291 INFO L87 Difference]: Start difference. First operand 524 states and 881 transitions. Second operand 11 states. [2018-07-23 15:15:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:42,948 INFO L93 Difference]: Finished difference Result 737 states and 1215 transitions. [2018-07-23 15:15:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:15:42,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:42,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:42,953 INFO L225 Difference]: With dead ends: 737 [2018-07-23 15:15:42,953 INFO L226 Difference]: Without dead ends: 736 [2018-07-23 15:15:42,954 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:15:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-07-23 15:15:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 623. [2018-07-23 15:15:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-07-23 15:15:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1052 transitions. [2018-07-23 15:15:43,336 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1052 transitions. Word has length 15 [2018-07-23 15:15:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:43,336 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1052 transitions. [2018-07-23 15:15:43,336 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1052 transitions. [2018-07-23 15:15:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:43,338 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:43,338 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 15:15:43,338 INFO L414 AbstractCegarLoop]: === Iteration 59 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1502802083, now seen corresponding path program 1 times [2018-07-23 15:15:43,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:43,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:43,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:15:43,352 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:15:43,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:15:43,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:15:43,352 INFO L87 Difference]: Start difference. First operand 623 states and 1052 transitions. Second operand 9 states. [2018-07-23 15:15:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:43,973 INFO L93 Difference]: Finished difference Result 819 states and 1364 transitions. [2018-07-23 15:15:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:15:43,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-23 15:15:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:43,977 INFO L225 Difference]: With dead ends: 819 [2018-07-23 15:15:43,978 INFO L226 Difference]: Without dead ends: 817 [2018-07-23 15:15:43,978 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:15:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-07-23 15:15:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 600. [2018-07-23 15:15:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-07-23 15:15:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1013 transitions. [2018-07-23 15:15:44,242 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1013 transitions. Word has length 15 [2018-07-23 15:15:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:44,243 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 1013 transitions. [2018-07-23 15:15:44,243 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:15:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1013 transitions. [2018-07-23 15:15:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:44,244 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:44,244 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:44,244 INFO L414 AbstractCegarLoop]: === Iteration 60 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash -708989572, now seen corresponding path program 1 times [2018-07-23 15:15:44,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:44,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:44,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:44,259 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:44,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:44,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:44,260 INFO L87 Difference]: Start difference. First operand 600 states and 1013 transitions. Second operand 11 states. [2018-07-23 15:15:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:44,703 INFO L93 Difference]: Finished difference Result 638 states and 1059 transitions. [2018-07-23 15:15:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:44,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:44,706 INFO L225 Difference]: With dead ends: 638 [2018-07-23 15:15:44,706 INFO L226 Difference]: Without dead ends: 637 [2018-07-23 15:15:44,707 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:15:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-07-23 15:15:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 587. [2018-07-23 15:15:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-07-23 15:15:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-07-23 15:15:45,044 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-07-23 15:15:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:45,045 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-07-23 15:15:45,045 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-07-23 15:15:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:45,046 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:45,046 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:45,046 INFO L414 AbstractCegarLoop]: === Iteration 61 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash -708189250, now seen corresponding path program 1 times [2018-07-23 15:15:45,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:45,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:45,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:45,061 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:45,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:45,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:45,061 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-07-23 15:15:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:45,544 INFO L93 Difference]: Finished difference Result 642 states and 1067 transitions. [2018-07-23 15:15:45,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:15:45,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 15:15:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:45,548 INFO L225 Difference]: With dead ends: 642 [2018-07-23 15:15:45,548 INFO L226 Difference]: Without dead ends: 640 [2018-07-23 15:15:45,549 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:15:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-07-23 15:15:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 587. [2018-07-23 15:15:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-07-23 15:15:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-07-23 15:15:45,896 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-07-23 15:15:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:45,896 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-07-23 15:15:45,896 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-07-23 15:15:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:45,897 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:45,897 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:45,898 INFO L414 AbstractCegarLoop]: === Iteration 62 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1511308848, now seen corresponding path program 2 times [2018-07-23 15:15:45,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:45,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:45,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:45,925 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:15:45,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:15:45,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:15:45,926 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-07-23 15:15:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:46,310 INFO L93 Difference]: Finished difference Result 610 states and 1020 transitions. [2018-07-23 15:15:46,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:15:46,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-23 15:15:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:46,314 INFO L225 Difference]: With dead ends: 610 [2018-07-23 15:15:46,314 INFO L226 Difference]: Without dead ends: 609 [2018-07-23 15:15:46,315 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-07-23 15:15:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 578. [2018-07-23 15:15:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-07-23 15:15:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 974 transitions. [2018-07-23 15:15:46,627 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 974 transitions. Word has length 15 [2018-07-23 15:15:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:46,627 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 974 transitions. [2018-07-23 15:15:46,627 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:15:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 974 transitions. [2018-07-23 15:15:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:46,628 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:46,628 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:46,629 INFO L414 AbstractCegarLoop]: === Iteration 63 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1638227434, now seen corresponding path program 1 times [2018-07-23 15:15:46,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:46,648 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:46,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:46,648 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:46,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:46,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:46,649 INFO L87 Difference]: Start difference. First operand 578 states and 974 transitions. Second operand 11 states. [2018-07-23 15:15:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:47,108 INFO L93 Difference]: Finished difference Result 633 states and 1050 transitions. [2018-07-23 15:15:47,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:15:47,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:47,112 INFO L225 Difference]: With dead ends: 633 [2018-07-23 15:15:47,112 INFO L226 Difference]: Without dead ends: 631 [2018-07-23 15:15:47,112 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:15:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-07-23 15:15:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 591. [2018-07-23 15:15:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-07-23 15:15:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 995 transitions. [2018-07-23 15:15:47,365 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 995 transitions. Word has length 15 [2018-07-23 15:15:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:47,365 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 995 transitions. [2018-07-23 15:15:47,366 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 995 transitions. [2018-07-23 15:15:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:47,367 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:47,367 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:47,367 INFO L414 AbstractCegarLoop]: === Iteration 64 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:47,367 INFO L82 PathProgramCache]: Analyzing trace with hash 553313350, now seen corresponding path program 1 times [2018-07-23 15:15:47,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:47,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:47,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:47,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:47,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:47,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:47,382 INFO L87 Difference]: Start difference. First operand 591 states and 995 transitions. Second operand 11 states. [2018-07-23 15:15:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:47,726 INFO L93 Difference]: Finished difference Result 620 states and 1034 transitions. [2018-07-23 15:15:47,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:47,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:47,729 INFO L225 Difference]: With dead ends: 620 [2018-07-23 15:15:47,729 INFO L226 Difference]: Without dead ends: 619 [2018-07-23 15:15:47,730 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:15:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-07-23 15:15:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 596. [2018-07-23 15:15:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-07-23 15:15:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1004 transitions. [2018-07-23 15:15:47,958 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1004 transitions. Word has length 15 [2018-07-23 15:15:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:47,958 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 1004 transitions. [2018-07-23 15:15:47,958 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1004 transitions. [2018-07-23 15:15:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 15:15:47,960 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:47,960 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-07-23 15:15:47,960 INFO L414 AbstractCegarLoop]: === Iteration 65 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1657460349, now seen corresponding path program 1 times [2018-07-23 15:15:47,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:47,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:47,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:15:47,978 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:15:47,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:15:47,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:15:47,979 INFO L87 Difference]: Start difference. First operand 596 states and 1004 transitions. Second operand 11 states. [2018-07-23 15:15:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:48,245 INFO L93 Difference]: Finished difference Result 601 states and 1009 transitions. [2018-07-23 15:15:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:15:48,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-23 15:15:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:48,247 INFO L225 Difference]: With dead ends: 601 [2018-07-23 15:15:48,248 INFO L226 Difference]: Without dead ends: 599 [2018-07-23 15:15:48,248 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:15:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-07-23 15:15:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2018-07-23 15:15:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-07-23 15:15:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 994 transitions. [2018-07-23 15:15:48,480 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 994 transitions. Word has length 15 [2018-07-23 15:15:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:48,481 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 994 transitions. [2018-07-23 15:15:48,481 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:15:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 994 transitions. [2018-07-23 15:15:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:15:48,481 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:48,482 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:48,482 INFO L414 AbstractCegarLoop]: === Iteration 66 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash -616146153, now seen corresponding path program 3 times [2018-07-23 15:15:48,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:48,488 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:48,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:48,488 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:48,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:48,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:48,488 INFO L87 Difference]: Start difference. First operand 590 states and 994 transitions. Second operand 8 states. [2018-07-23 15:15:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:48,848 INFO L93 Difference]: Finished difference Result 652 states and 1080 transitions. [2018-07-23 15:15:48,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:48,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 15:15:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:48,850 INFO L225 Difference]: With dead ends: 652 [2018-07-23 15:15:48,850 INFO L226 Difference]: Without dead ends: 650 [2018-07-23 15:15:48,851 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-07-23 15:15:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 534. [2018-07-23 15:15:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-07-23 15:15:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 901 transitions. [2018-07-23 15:15:49,069 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 901 transitions. Word has length 16 [2018-07-23 15:15:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:49,070 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 901 transitions. [2018-07-23 15:15:49,070 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 901 transitions. [2018-07-23 15:15:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:15:49,071 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:49,071 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:49,071 INFO L414 AbstractCegarLoop]: === Iteration 67 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1231757577, now seen corresponding path program 4 times [2018-07-23 15:15:49,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:49,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:49,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:49,077 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:49,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:49,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:49,078 INFO L87 Difference]: Start difference. First operand 534 states and 901 transitions. Second operand 8 states. [2018-07-23 15:15:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:49,364 INFO L93 Difference]: Finished difference Result 587 states and 970 transitions. [2018-07-23 15:15:49,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:49,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 15:15:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:49,367 INFO L225 Difference]: With dead ends: 587 [2018-07-23 15:15:49,367 INFO L226 Difference]: Without dead ends: 585 [2018-07-23 15:15:49,368 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:15:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-07-23 15:15:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 518. [2018-07-23 15:15:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-23 15:15:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-23 15:15:49,572 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-23 15:15:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:49,573 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-23 15:15:49,573 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-23 15:15:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:15:49,574 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:49,574 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:49,574 INFO L414 AbstractCegarLoop]: === Iteration 68 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-07-23 15:15:49,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:49,581 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:49,581 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:49,582 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:49,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:49,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:49,582 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-23 15:15:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:49,944 INFO L93 Difference]: Finished difference Result 599 states and 990 transitions. [2018-07-23 15:15:49,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:49,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 15:15:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:49,947 INFO L225 Difference]: With dead ends: 599 [2018-07-23 15:15:49,947 INFO L226 Difference]: Without dead ends: 597 [2018-07-23 15:15:49,948 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-07-23 15:15:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 523. [2018-07-23 15:15:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-07-23 15:15:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 880 transitions. [2018-07-23 15:15:50,200 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 880 transitions. Word has length 16 [2018-07-23 15:15:50,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:50,200 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 880 transitions. [2018-07-23 15:15:50,200 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 880 transitions. [2018-07-23 15:15:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:15:50,201 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:50,201 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:50,201 INFO L414 AbstractCegarLoop]: === Iteration 69 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:50,201 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-07-23 15:15:50,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:50,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:50,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:50,209 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:50,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:50,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:50,210 INFO L87 Difference]: Start difference. First operand 523 states and 880 transitions. Second operand 8 states. [2018-07-23 15:15:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:50,639 INFO L93 Difference]: Finished difference Result 581 states and 960 transitions. [2018-07-23 15:15:50,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:50,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 15:15:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:50,642 INFO L225 Difference]: With dead ends: 581 [2018-07-23 15:15:50,642 INFO L226 Difference]: Without dead ends: 579 [2018-07-23 15:15:50,642 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:15:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-23 15:15:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-07-23 15:15:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-23 15:15:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-23 15:15:50,855 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-23 15:15:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:50,855 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-23 15:15:50,855 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-23 15:15:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:15:50,856 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:50,856 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:50,856 INFO L414 AbstractCegarLoop]: === Iteration 70 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-07-23 15:15:50,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:50,865 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:50,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:50,866 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:50,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:50,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:50,866 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-23 15:15:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:51,179 INFO L93 Difference]: Finished difference Result 575 states and 954 transitions. [2018-07-23 15:15:51,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:51,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 15:15:51,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:51,182 INFO L225 Difference]: With dead ends: 575 [2018-07-23 15:15:51,182 INFO L226 Difference]: Without dead ends: 573 [2018-07-23 15:15:51,183 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:15:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-07-23 15:15:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 521. [2018-07-23 15:15:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-07-23 15:15:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 877 transitions. [2018-07-23 15:15:51,412 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 877 transitions. Word has length 16 [2018-07-23 15:15:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:51,413 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 877 transitions. [2018-07-23 15:15:51,413 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 877 transitions. [2018-07-23 15:15:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:15:51,413 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:51,414 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:51,414 INFO L414 AbstractCegarLoop]: === Iteration 71 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:51,414 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-07-23 15:15:51,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:51,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:51,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:51,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:51,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:51,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:51,422 INFO L87 Difference]: Start difference. First operand 521 states and 877 transitions. Second operand 8 states. [2018-07-23 15:15:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:51,901 INFO L93 Difference]: Finished difference Result 581 states and 961 transitions. [2018-07-23 15:15:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:51,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 15:15:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:51,904 INFO L225 Difference]: With dead ends: 581 [2018-07-23 15:15:51,905 INFO L226 Difference]: Without dead ends: 579 [2018-07-23 15:15:51,905 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-23 15:15:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-07-23 15:15:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-23 15:15:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-23 15:15:52,259 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-23 15:15:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:52,260 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-23 15:15:52,260 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-23 15:15:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:15:52,261 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:52,261 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:52,261 INFO L414 AbstractCegarLoop]: === Iteration 72 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:52,261 INFO L82 PathProgramCache]: Analyzing trace with hash 472492110, now seen corresponding path program 3 times [2018-07-23 15:15:52,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:52,270 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:52,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:52,271 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:52,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:52,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:52,271 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-23 15:15:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:52,626 INFO L93 Difference]: Finished difference Result 573 states and 946 transitions. [2018-07-23 15:15:52,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:52,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 15:15:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:52,629 INFO L225 Difference]: With dead ends: 573 [2018-07-23 15:15:52,629 INFO L226 Difference]: Without dead ends: 571 [2018-07-23 15:15:52,630 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:15:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-07-23 15:15:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 512. [2018-07-23 15:15:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-07-23 15:15:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 862 transitions. [2018-07-23 15:15:52,879 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 862 transitions. Word has length 16 [2018-07-23 15:15:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:52,879 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 862 transitions. [2018-07-23 15:15:52,879 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 862 transitions. [2018-07-23 15:15:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:15:52,880 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:52,880 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:52,881 INFO L414 AbstractCegarLoop]: === Iteration 73 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1974571456, now seen corresponding path program 4 times [2018-07-23 15:15:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:52,891 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:52,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:15:52,892 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:15:52,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:15:52,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:15:52,892 INFO L87 Difference]: Start difference. First operand 512 states and 862 transitions. Second operand 8 states. [2018-07-23 15:15:53,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:53,230 INFO L93 Difference]: Finished difference Result 564 states and 935 transitions. [2018-07-23 15:15:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:53,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-23 15:15:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:53,233 INFO L225 Difference]: With dead ends: 564 [2018-07-23 15:15:53,234 INFO L226 Difference]: Without dead ends: 562 [2018-07-23 15:15:53,234 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:15:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-07-23 15:15:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 452. [2018-07-23 15:15:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-07-23 15:15:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 761 transitions. [2018-07-23 15:15:53,489 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 761 transitions. Word has length 16 [2018-07-23 15:15:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:53,489 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 761 transitions. [2018-07-23 15:15:53,489 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:15:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 761 transitions. [2018-07-23 15:15:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:53,491 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:53,491 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:53,491 INFO L414 AbstractCegarLoop]: === Iteration 74 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1651842093, now seen corresponding path program 1 times [2018-07-23 15:15:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:53,512 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:53,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:15:53,513 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:15:53,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:15:53,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:15:53,513 INFO L87 Difference]: Start difference. First operand 452 states and 761 transitions. Second operand 13 states. [2018-07-23 15:15:53,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:53,893 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-07-23 15:15:53,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:15:53,893 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-23 15:15:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:53,895 INFO L225 Difference]: With dead ends: 480 [2018-07-23 15:15:53,895 INFO L226 Difference]: Without dead ends: 479 [2018-07-23 15:15:53,896 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:15:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-07-23 15:15:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 430. [2018-07-23 15:15:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-07-23 15:15:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 722 transitions. [2018-07-23 15:15:54,103 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 722 transitions. Word has length 17 [2018-07-23 15:15:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:54,103 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 722 transitions. [2018-07-23 15:15:54,104 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:15:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 722 transitions. [2018-07-23 15:15:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:54,105 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:54,105 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:54,105 INFO L414 AbstractCegarLoop]: === Iteration 75 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash 692781, now seen corresponding path program 1 times [2018-07-23 15:15:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:54,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:54,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:15:54,122 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:15:54,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:15:54,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:54,122 INFO L87 Difference]: Start difference. First operand 430 states and 722 transitions. Second operand 12 states. [2018-07-23 15:15:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:54,476 INFO L93 Difference]: Finished difference Result 545 states and 906 transitions. [2018-07-23 15:15:54,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:15:54,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 15:15:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:54,478 INFO L225 Difference]: With dead ends: 545 [2018-07-23 15:15:54,478 INFO L226 Difference]: Without dead ends: 544 [2018-07-23 15:15:54,479 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:15:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-07-23 15:15:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 451. [2018-07-23 15:15:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-23 15:15:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 757 transitions. [2018-07-23 15:15:54,721 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 757 transitions. Word has length 17 [2018-07-23 15:15:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:54,721 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 757 transitions. [2018-07-23 15:15:54,721 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:15:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 757 transitions. [2018-07-23 15:15:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:54,722 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:54,722 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:54,722 INFO L414 AbstractCegarLoop]: === Iteration 76 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash 337396676, now seen corresponding path program 1 times [2018-07-23 15:15:54,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:54,737 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:54,737 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:15:54,737 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:15:54,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:15:54,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:54,738 INFO L87 Difference]: Start difference. First operand 451 states and 757 transitions. Second operand 12 states. [2018-07-23 15:15:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:55,028 INFO L93 Difference]: Finished difference Result 458 states and 767 transitions. [2018-07-23 15:15:55,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:55,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 15:15:55,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:55,030 INFO L225 Difference]: With dead ends: 458 [2018-07-23 15:15:55,030 INFO L226 Difference]: Without dead ends: 457 [2018-07-23 15:15:55,030 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:15:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-07-23 15:15:55,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2018-07-23 15:15:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-07-23 15:15:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 709 transitions. [2018-07-23 15:15:55,347 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 709 transitions. Word has length 17 [2018-07-23 15:15:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:55,347 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 709 transitions. [2018-07-23 15:15:55,347 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:15:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 709 transitions. [2018-07-23 15:15:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:55,348 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:55,348 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:55,348 INFO L414 AbstractCegarLoop]: === Iteration 77 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:55,348 INFO L82 PathProgramCache]: Analyzing trace with hash -449446913, now seen corresponding path program 2 times [2018-07-23 15:15:55,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:55,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:55,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:15:55,365 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:15:55,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:15:55,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:15:55,366 INFO L87 Difference]: Start difference. First operand 423 states and 709 transitions. Second operand 13 states. [2018-07-23 15:15:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:55,809 INFO L93 Difference]: Finished difference Result 508 states and 829 transitions. [2018-07-23 15:15:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:15:55,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-23 15:15:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:55,812 INFO L225 Difference]: With dead ends: 508 [2018-07-23 15:15:55,812 INFO L226 Difference]: Without dead ends: 507 [2018-07-23 15:15:55,812 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:15:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-07-23 15:15:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2018-07-23 15:15:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-07-23 15:15:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 736 transitions. [2018-07-23 15:15:56,061 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 736 transitions. Word has length 17 [2018-07-23 15:15:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:56,061 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 736 transitions. [2018-07-23 15:15:56,062 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:15:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 736 transitions. [2018-07-23 15:15:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:56,062 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:56,062 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-07-23 15:15:56,062 INFO L414 AbstractCegarLoop]: === Iteration 78 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1940633158, now seen corresponding path program 1 times [2018-07-23 15:15:56,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:56,086 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:56,086 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:15:56,086 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:15:56,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:15:56,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:15:56,087 INFO L87 Difference]: Start difference. First operand 440 states and 736 transitions. Second operand 13 states. [2018-07-23 15:15:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:56,368 INFO L93 Difference]: Finished difference Result 446 states and 743 transitions. [2018-07-23 15:15:56,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:15:56,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-23 15:15:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:56,369 INFO L225 Difference]: With dead ends: 446 [2018-07-23 15:15:56,369 INFO L226 Difference]: Without dead ends: 445 [2018-07-23 15:15:56,370 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:15:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-07-23 15:15:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 424. [2018-07-23 15:15:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-07-23 15:15:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 709 transitions. [2018-07-23 15:15:56,608 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 709 transitions. Word has length 17 [2018-07-23 15:15:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:56,608 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 709 transitions. [2018-07-23 15:15:56,608 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:15:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 709 transitions. [2018-07-23 15:15:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:56,609 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:56,609 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:56,609 INFO L414 AbstractCegarLoop]: === Iteration 79 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash -453832993, now seen corresponding path program 1 times [2018-07-23 15:15:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:56,629 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:56,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:15:56,629 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:15:56,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:15:56,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:56,630 INFO L87 Difference]: Start difference. First operand 424 states and 709 transitions. Second operand 12 states. [2018-07-23 15:15:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:57,102 INFO L93 Difference]: Finished difference Result 505 states and 821 transitions. [2018-07-23 15:15:57,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:15:57,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 15:15:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:57,104 INFO L225 Difference]: With dead ends: 505 [2018-07-23 15:15:57,104 INFO L226 Difference]: Without dead ends: 504 [2018-07-23 15:15:57,105 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:15:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-07-23 15:15:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 453. [2018-07-23 15:15:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-07-23 15:15:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 755 transitions. [2018-07-23 15:15:57,400 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 755 transitions. Word has length 17 [2018-07-23 15:15:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:57,400 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 755 transitions. [2018-07-23 15:15:57,400 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:15:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 755 transitions. [2018-07-23 15:15:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:57,401 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:57,401 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:57,401 INFO L414 AbstractCegarLoop]: === Iteration 80 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1757610527, now seen corresponding path program 1 times [2018-07-23 15:15:57,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:57,417 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:57,417 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:15:57,417 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:15:57,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:15:57,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:57,418 INFO L87 Difference]: Start difference. First operand 453 states and 755 transitions. Second operand 12 states. [2018-07-23 15:15:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:57,868 INFO L93 Difference]: Finished difference Result 516 states and 838 transitions. [2018-07-23 15:15:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:15:57,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 15:15:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:57,870 INFO L225 Difference]: With dead ends: 516 [2018-07-23 15:15:57,870 INFO L226 Difference]: Without dead ends: 515 [2018-07-23 15:15:57,871 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:15:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-07-23 15:15:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 449. [2018-07-23 15:15:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-07-23 15:15:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 748 transitions. [2018-07-23 15:15:58,132 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 748 transitions. Word has length 17 [2018-07-23 15:15:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:58,132 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 748 transitions. [2018-07-23 15:15:58,132 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:15:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 748 transitions. [2018-07-23 15:15:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:58,133 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:58,133 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:58,133 INFO L414 AbstractCegarLoop]: === Iteration 81 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1709007603, now seen corresponding path program 1 times [2018-07-23 15:15:58,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:58,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:58,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:15:58,150 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:15:58,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:15:58,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:15:58,151 INFO L87 Difference]: Start difference. First operand 449 states and 748 transitions. Second operand 13 states. [2018-07-23 15:15:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:58,543 INFO L93 Difference]: Finished difference Result 526 states and 863 transitions. [2018-07-23 15:15:58,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:15:58,544 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-23 15:15:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:58,545 INFO L225 Difference]: With dead ends: 526 [2018-07-23 15:15:58,545 INFO L226 Difference]: Without dead ends: 524 [2018-07-23 15:15:58,545 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:15:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-07-23 15:15:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 455. [2018-07-23 15:15:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-07-23 15:15:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 760 transitions. [2018-07-23 15:15:58,818 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 760 transitions. Word has length 17 [2018-07-23 15:15:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:58,818 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 760 transitions. [2018-07-23 15:15:58,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:15:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 760 transitions. [2018-07-23 15:15:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 15:15:58,819 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:58,819 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:58,819 INFO L414 AbstractCegarLoop]: === Iteration 82 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash -840518133, now seen corresponding path program 2 times [2018-07-23 15:15:58,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:58,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:58,832 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:15:58,832 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:15:58,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:15:58,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:58,833 INFO L87 Difference]: Start difference. First operand 455 states and 760 transitions. Second operand 12 states. [2018-07-23 15:15:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:59,184 INFO L93 Difference]: Finished difference Result 499 states and 825 transitions. [2018-07-23 15:15:59,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:15:59,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-23 15:15:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:59,185 INFO L225 Difference]: With dead ends: 499 [2018-07-23 15:15:59,185 INFO L226 Difference]: Without dead ends: 498 [2018-07-23 15:15:59,186 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:15:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-07-23 15:15:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 428. [2018-07-23 15:15:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-07-23 15:15:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 713 transitions. [2018-07-23 15:15:59,436 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 713 transitions. Word has length 17 [2018-07-23 15:15:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:15:59,436 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 713 transitions. [2018-07-23 15:15:59,436 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:15:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 713 transitions. [2018-07-23 15:15:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:15:59,437 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:15:59,437 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:15:59,437 INFO L414 AbstractCegarLoop]: === Iteration 83 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:15:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1270158156, now seen corresponding path program 1 times [2018-07-23 15:15:59,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:15:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:15:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:15:59,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:15:59,453 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:15:59,453 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:15:59,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:15:59,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:15:59,454 INFO L87 Difference]: Start difference. First operand 428 states and 713 transitions. Second operand 12 states. [2018-07-23 15:15:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:15:59,824 INFO L93 Difference]: Finished difference Result 491 states and 812 transitions. [2018-07-23 15:15:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:15:59,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 15:15:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:15:59,825 INFO L225 Difference]: With dead ends: 491 [2018-07-23 15:15:59,825 INFO L226 Difference]: Without dead ends: 490 [2018-07-23 15:15:59,825 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:15:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-07-23 15:16:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 466. [2018-07-23 15:16:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-23 15:16:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 779 transitions. [2018-07-23 15:16:00,092 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 779 transitions. Word has length 18 [2018-07-23 15:16:00,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:00,092 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 779 transitions. [2018-07-23 15:16:00,092 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:16:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 779 transitions. [2018-07-23 15:16:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:00,093 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:00,093 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:00,094 INFO L414 AbstractCegarLoop]: === Iteration 84 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:00,094 INFO L82 PathProgramCache]: Analyzing trace with hash -301522250, now seen corresponding path program 1 times [2018-07-23 15:16:00,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:00,107 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:00,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:16:00,107 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:16:00,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:16:00,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:16:00,108 INFO L87 Difference]: Start difference. First operand 466 states and 779 transitions. Second operand 12 states. [2018-07-23 15:16:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:00,589 INFO L93 Difference]: Finished difference Result 563 states and 925 transitions. [2018-07-23 15:16:00,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:16:00,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 15:16:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:00,590 INFO L225 Difference]: With dead ends: 563 [2018-07-23 15:16:00,590 INFO L226 Difference]: Without dead ends: 561 [2018-07-23 15:16:00,590 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:16:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-07-23 15:16:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 458. [2018-07-23 15:16:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-07-23 15:16:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 765 transitions. [2018-07-23 15:16:00,853 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 765 transitions. Word has length 18 [2018-07-23 15:16:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:00,854 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 765 transitions. [2018-07-23 15:16:00,854 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:16:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 765 transitions. [2018-07-23 15:16:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:00,854 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:00,854 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:00,855 INFO L414 AbstractCegarLoop]: === Iteration 85 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:00,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1503466215, now seen corresponding path program 1 times [2018-07-23 15:16:00,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:00,874 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:00,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:16:00,875 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:16:00,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:16:00,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:16:00,875 INFO L87 Difference]: Start difference. First operand 458 states and 765 transitions. Second operand 11 states. [2018-07-23 15:16:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:01,435 INFO L93 Difference]: Finished difference Result 513 states and 833 transitions. [2018-07-23 15:16:01,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:16:01,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 15:16:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:01,437 INFO L225 Difference]: With dead ends: 513 [2018-07-23 15:16:01,437 INFO L226 Difference]: Without dead ends: 511 [2018-07-23 15:16:01,437 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:16:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-07-23 15:16:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 459. [2018-07-23 15:16:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-07-23 15:16:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 767 transitions. [2018-07-23 15:16:01,708 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 767 transitions. Word has length 18 [2018-07-23 15:16:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:01,708 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 767 transitions. [2018-07-23 15:16:01,708 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:16:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 767 transitions. [2018-07-23 15:16:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:01,709 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:01,709 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:01,709 INFO L414 AbstractCegarLoop]: === Iteration 86 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172812, now seen corresponding path program 2 times [2018-07-23 15:16:01,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:01,727 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:01,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:01,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:01,728 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:01,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:01,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:01,728 INFO L87 Difference]: Start difference. First operand 459 states and 767 transitions. Second operand 13 states. [2018-07-23 15:16:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:02,144 INFO L93 Difference]: Finished difference Result 507 states and 835 transitions. [2018-07-23 15:16:02,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:16:02,144 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-23 15:16:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:02,146 INFO L225 Difference]: With dead ends: 507 [2018-07-23 15:16:02,146 INFO L226 Difference]: Without dead ends: 506 [2018-07-23 15:16:02,146 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:16:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-07-23 15:16:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 466. [2018-07-23 15:16:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-23 15:16:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 780 transitions. [2018-07-23 15:16:02,419 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 780 transitions. Word has length 18 [2018-07-23 15:16:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:02,419 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 780 transitions. [2018-07-23 15:16:02,419 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 780 transitions. [2018-07-23 15:16:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:02,420 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:02,420 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:02,420 INFO L414 AbstractCegarLoop]: === Iteration 87 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172524, now seen corresponding path program 1 times [2018-07-23 15:16:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:02,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:02,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:16:02,430 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:16:02,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:16:02,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:16:02,431 INFO L87 Difference]: Start difference. First operand 466 states and 780 transitions. Second operand 11 states. [2018-07-23 15:16:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:02,861 INFO L93 Difference]: Finished difference Result 518 states and 845 transitions. [2018-07-23 15:16:02,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:16:02,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 15:16:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:02,862 INFO L225 Difference]: With dead ends: 518 [2018-07-23 15:16:02,863 INFO L226 Difference]: Without dead ends: 516 [2018-07-23 15:16:02,863 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:16:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-07-23 15:16:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 469. [2018-07-23 15:16:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-23 15:16:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 783 transitions. [2018-07-23 15:16:03,203 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 783 transitions. Word has length 18 [2018-07-23 15:16:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:03,203 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 783 transitions. [2018-07-23 15:16:03,203 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:16:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 783 transitions. [2018-07-23 15:16:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:03,203 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:03,204 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:03,204 INFO L414 AbstractCegarLoop]: === Iteration 88 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1215585637, now seen corresponding path program 1 times [2018-07-23 15:16:03,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:03,215 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:03,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:16:03,215 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:16:03,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:16:03,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:16:03,216 INFO L87 Difference]: Start difference. First operand 469 states and 783 transitions. Second operand 11 states. [2018-07-23 15:16:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:03,645 INFO L93 Difference]: Finished difference Result 531 states and 868 transitions. [2018-07-23 15:16:03,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:16:03,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 15:16:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:03,646 INFO L225 Difference]: With dead ends: 531 [2018-07-23 15:16:03,646 INFO L226 Difference]: Without dead ends: 529 [2018-07-23 15:16:03,647 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:16:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-07-23 15:16:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 470. [2018-07-23 15:16:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-07-23 15:16:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 785 transitions. [2018-07-23 15:16:03,996 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 785 transitions. Word has length 18 [2018-07-23 15:16:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:03,997 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 785 transitions. [2018-07-23 15:16:03,997 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:16:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 785 transitions. [2018-07-23 15:16:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:03,997 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:03,997 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:03,998 INFO L414 AbstractCegarLoop]: === Iteration 89 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-07-23 15:16:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:04,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:04,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:16:04,015 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:16:04,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:16:04,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:16:04,016 INFO L87 Difference]: Start difference. First operand 470 states and 785 transitions. Second operand 12 states. [2018-07-23 15:16:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:04,542 INFO L93 Difference]: Finished difference Result 545 states and 895 transitions. [2018-07-23 15:16:04,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:16:04,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 15:16:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:04,544 INFO L225 Difference]: With dead ends: 545 [2018-07-23 15:16:04,544 INFO L226 Difference]: Without dead ends: 543 [2018-07-23 15:16:04,544 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:16:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-07-23 15:16:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 474. [2018-07-23 15:16:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-07-23 15:16:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 791 transitions. [2018-07-23 15:16:04,832 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 791 transitions. Word has length 18 [2018-07-23 15:16:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:04,832 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 791 transitions. [2018-07-23 15:16:04,832 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:16:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 791 transitions. [2018-07-23 15:16:04,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:04,833 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:04,833 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:04,833 INFO L414 AbstractCegarLoop]: === Iteration 90 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1467012, now seen corresponding path program 1 times [2018-07-23 15:16:04,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:04,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:04,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:16:04,846 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:16:04,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:16:04,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:16:04,846 INFO L87 Difference]: Start difference. First operand 474 states and 791 transitions. Second operand 11 states. [2018-07-23 15:16:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:05,373 INFO L93 Difference]: Finished difference Result 634 states and 1037 transitions. [2018-07-23 15:16:05,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:16:05,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 15:16:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:05,376 INFO L225 Difference]: With dead ends: 634 [2018-07-23 15:16:05,376 INFO L226 Difference]: Without dead ends: 632 [2018-07-23 15:16:05,377 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:16:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-07-23 15:16:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 493. [2018-07-23 15:16:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-07-23 15:16:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 822 transitions. [2018-07-23 15:16:05,904 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 822 transitions. Word has length 18 [2018-07-23 15:16:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:05,904 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 822 transitions. [2018-07-23 15:16:05,904 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:16:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 822 transitions. [2018-07-23 15:16:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:05,905 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:05,905 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:05,906 INFO L414 AbstractCegarLoop]: === Iteration 91 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1846437006, now seen corresponding path program 1 times [2018-07-23 15:16:05,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:05,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:05,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:05,924 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:05,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:05,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:05,924 INFO L87 Difference]: Start difference. First operand 493 states and 822 transitions. Second operand 13 states. [2018-07-23 15:16:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:06,574 INFO L93 Difference]: Finished difference Result 574 states and 939 transitions. [2018-07-23 15:16:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:16:06,574 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-23 15:16:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:06,576 INFO L225 Difference]: With dead ends: 574 [2018-07-23 15:16:06,576 INFO L226 Difference]: Without dead ends: 573 [2018-07-23 15:16:06,577 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:16:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-07-23 15:16:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 491. [2018-07-23 15:16:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-07-23 15:16:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 817 transitions. [2018-07-23 15:16:06,955 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 817 transitions. Word has length 18 [2018-07-23 15:16:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:06,956 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 817 transitions. [2018-07-23 15:16:06,956 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 817 transitions. [2018-07-23 15:16:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:06,956 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:06,956 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:06,957 INFO L414 AbstractCegarLoop]: === Iteration 92 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1846436718, now seen corresponding path program 2 times [2018-07-23 15:16:06,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:06,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:06,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:16:06,970 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:16:06,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:16:06,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:16:06,971 INFO L87 Difference]: Start difference. First operand 491 states and 817 transitions. Second operand 11 states. [2018-07-23 15:16:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:07,435 INFO L93 Difference]: Finished difference Result 557 states and 901 transitions. [2018-07-23 15:16:07,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:16:07,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 15:16:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:07,436 INFO L225 Difference]: With dead ends: 557 [2018-07-23 15:16:07,437 INFO L226 Difference]: Without dead ends: 555 [2018-07-23 15:16:07,437 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:16:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-23 15:16:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 477. [2018-07-23 15:16:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-07-23 15:16:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 791 transitions. [2018-07-23 15:16:07,734 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 791 transitions. Word has length 18 [2018-07-23 15:16:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:07,734 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 791 transitions. [2018-07-23 15:16:07,734 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:16:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 791 transitions. [2018-07-23 15:16:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:07,735 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:07,735 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:07,735 INFO L414 AbstractCegarLoop]: === Iteration 93 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1837849831, now seen corresponding path program 1 times [2018-07-23 15:16:07,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:07,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:07,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:16:07,747 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:16:07,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:16:07,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:16:07,747 INFO L87 Difference]: Start difference. First operand 477 states and 791 transitions. Second operand 11 states. [2018-07-23 15:16:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:08,278 INFO L93 Difference]: Finished difference Result 557 states and 903 transitions. [2018-07-23 15:16:08,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:16:08,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-23 15:16:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:08,279 INFO L225 Difference]: With dead ends: 557 [2018-07-23 15:16:08,279 INFO L226 Difference]: Without dead ends: 555 [2018-07-23 15:16:08,279 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:16:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-23 15:16:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 467. [2018-07-23 15:16:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-07-23 15:16:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 775 transitions. [2018-07-23 15:16:08,619 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 775 transitions. Word has length 18 [2018-07-23 15:16:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:08,619 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 775 transitions. [2018-07-23 15:16:08,619 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:16:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 775 transitions. [2018-07-23 15:16:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:08,619 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:08,620 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:08,620 INFO L414 AbstractCegarLoop]: === Iteration 94 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:08,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1884609208, now seen corresponding path program 1 times [2018-07-23 15:16:08,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:08,650 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:08,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:16:08,650 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:16:08,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:16:08,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:16:08,651 INFO L87 Difference]: Start difference. First operand 467 states and 775 transitions. Second operand 12 states. [2018-07-23 15:16:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:09,201 INFO L93 Difference]: Finished difference Result 594 states and 971 transitions. [2018-07-23 15:16:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:16:09,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-23 15:16:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:09,202 INFO L225 Difference]: With dead ends: 594 [2018-07-23 15:16:09,202 INFO L226 Difference]: Without dead ends: 592 [2018-07-23 15:16:09,202 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:16:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-07-23 15:16:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 469. [2018-07-23 15:16:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-23 15:16:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 778 transitions. [2018-07-23 15:16:09,626 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 778 transitions. Word has length 18 [2018-07-23 15:16:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:09,627 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 778 transitions. [2018-07-23 15:16:09,627 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:16:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 778 transitions. [2018-07-23 15:16:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:09,627 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:09,627 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:09,627 INFO L414 AbstractCegarLoop]: === Iteration 95 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-07-23 15:16:09,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:09,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:09,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:09,637 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:09,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:09,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:09,638 INFO L87 Difference]: Start difference. First operand 469 states and 778 transitions. Second operand 10 states. [2018-07-23 15:16:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:10,084 INFO L93 Difference]: Finished difference Result 531 states and 864 transitions. [2018-07-23 15:16:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:16:10,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:10,085 INFO L225 Difference]: With dead ends: 531 [2018-07-23 15:16:10,085 INFO L226 Difference]: Without dead ends: 529 [2018-07-23 15:16:10,085 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:16:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-07-23 15:16:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 473. [2018-07-23 15:16:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-07-23 15:16:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 785 transitions. [2018-07-23 15:16:10,391 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 785 transitions. Word has length 18 [2018-07-23 15:16:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 785 transitions. [2018-07-23 15:16:10,391 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 785 transitions. [2018-07-23 15:16:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:10,392 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:10,392 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:10,392 INFO L414 AbstractCegarLoop]: === Iteration 96 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:10,392 INFO L82 PathProgramCache]: Analyzing trace with hash 589748198, now seen corresponding path program 1 times [2018-07-23 15:16:10,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:10,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:10,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:10,406 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:10,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:10,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:10,407 INFO L87 Difference]: Start difference. First operand 473 states and 785 transitions. Second operand 10 states. [2018-07-23 15:16:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:10,884 INFO L93 Difference]: Finished difference Result 578 states and 943 transitions. [2018-07-23 15:16:10,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:16:10,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:10,885 INFO L225 Difference]: With dead ends: 578 [2018-07-23 15:16:10,886 INFO L226 Difference]: Without dead ends: 576 [2018-07-23 15:16:10,886 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:16:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-07-23 15:16:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 496. [2018-07-23 15:16:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-07-23 15:16:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 824 transitions. [2018-07-23 15:16:11,212 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 824 transitions. Word has length 18 [2018-07-23 15:16:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:11,213 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 824 transitions. [2018-07-23 15:16:11,213 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 824 transitions. [2018-07-23 15:16:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:11,214 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:11,214 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:11,214 INFO L414 AbstractCegarLoop]: === Iteration 97 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash 581159259, now seen corresponding path program 1 times [2018-07-23 15:16:11,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:11,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:11,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:16:11,222 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:16:11,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:16:11,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:16:11,223 INFO L87 Difference]: Start difference. First operand 496 states and 824 transitions. Second operand 9 states. [2018-07-23 15:16:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:11,654 INFO L93 Difference]: Finished difference Result 551 states and 898 transitions. [2018-07-23 15:16:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:16:11,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-23 15:16:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:11,655 INFO L225 Difference]: With dead ends: 551 [2018-07-23 15:16:11,655 INFO L226 Difference]: Without dead ends: 549 [2018-07-23 15:16:11,655 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:16:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-07-23 15:16:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 500. [2018-07-23 15:16:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-07-23 15:16:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 828 transitions. [2018-07-23 15:16:11,978 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 828 transitions. Word has length 18 [2018-07-23 15:16:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:11,979 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 828 transitions. [2018-07-23 15:16:11,979 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:16:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 828 transitions. [2018-07-23 15:16:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:11,979 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:11,979 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:11,979 INFO L414 AbstractCegarLoop]: === Iteration 98 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1629830792, now seen corresponding path program 1 times [2018-07-23 15:16:11,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:11,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:11,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:11,991 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:11,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:11,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:11,992 INFO L87 Difference]: Start difference. First operand 500 states and 828 transitions. Second operand 10 states. [2018-07-23 15:16:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:12,506 INFO L93 Difference]: Finished difference Result 581 states and 944 transitions. [2018-07-23 15:16:12,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:16:12,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:12,508 INFO L225 Difference]: With dead ends: 581 [2018-07-23 15:16:12,508 INFO L226 Difference]: Without dead ends: 579 [2018-07-23 15:16:12,508 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:16:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-23 15:16:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 504. [2018-07-23 15:16:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-07-23 15:16:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 834 transitions. [2018-07-23 15:16:12,886 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 834 transitions. Word has length 18 [2018-07-23 15:16:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:12,886 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 834 transitions. [2018-07-23 15:16:12,886 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 834 transitions. [2018-07-23 15:16:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:12,887 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:12,887 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:12,887 INFO L414 AbstractCegarLoop]: === Iteration 99 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1655320734, now seen corresponding path program 2 times [2018-07-23 15:16:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:12,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:12,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:12,897 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:12,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:12,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:12,898 INFO L87 Difference]: Start difference. First operand 504 states and 834 transitions. Second operand 10 states. [2018-07-23 15:16:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:13,469 INFO L93 Difference]: Finished difference Result 630 states and 1024 transitions. [2018-07-23 15:16:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:16:13,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:13,470 INFO L225 Difference]: With dead ends: 630 [2018-07-23 15:16:13,471 INFO L226 Difference]: Without dead ends: 628 [2018-07-23 15:16:13,471 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:16:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-07-23 15:16:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 509. [2018-07-23 15:16:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-07-23 15:16:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 843 transitions. [2018-07-23 15:16:13,811 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 843 transitions. Word has length 18 [2018-07-23 15:16:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:13,811 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 843 transitions. [2018-07-23 15:16:13,812 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 843 transitions. [2018-07-23 15:16:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:13,812 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:13,812 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:13,812 INFO L414 AbstractCegarLoop]: === Iteration 100 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:13,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1646731795, now seen corresponding path program 2 times [2018-07-23 15:16:13,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:13,821 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:13,821 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:13,821 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:13,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:13,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:13,822 INFO L87 Difference]: Start difference. First operand 509 states and 843 transitions. Second operand 10 states. [2018-07-23 15:16:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:14,406 INFO L93 Difference]: Finished difference Result 620 states and 1007 transitions. [2018-07-23 15:16:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 15:16:14,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:14,407 INFO L225 Difference]: With dead ends: 620 [2018-07-23 15:16:14,407 INFO L226 Difference]: Without dead ends: 618 [2018-07-23 15:16:14,407 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:16:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-07-23 15:16:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 510. [2018-07-23 15:16:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-07-23 15:16:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 845 transitions. [2018-07-23 15:16:14,748 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 845 transitions. Word has length 18 [2018-07-23 15:16:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:14,748 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 845 transitions. [2018-07-23 15:16:14,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 845 transitions. [2018-07-23 15:16:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:14,749 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:14,749 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:14,749 INFO L414 AbstractCegarLoop]: === Iteration 101 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash -800331771, now seen corresponding path program 3 times [2018-07-23 15:16:14,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:14,763 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:14,763 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:14,764 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:14,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:14,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:14,764 INFO L87 Difference]: Start difference. First operand 510 states and 845 transitions. Second operand 10 states. [2018-07-23 15:16:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:15,545 INFO L93 Difference]: Finished difference Result 703 states and 1148 transitions. [2018-07-23 15:16:15,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:16:15,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:15,546 INFO L225 Difference]: With dead ends: 703 [2018-07-23 15:16:15,546 INFO L226 Difference]: Without dead ends: 701 [2018-07-23 15:16:15,546 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:16:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-07-23 15:16:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 530. [2018-07-23 15:16:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-07-23 15:16:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 879 transitions. [2018-07-23 15:16:15,901 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 879 transitions. Word has length 18 [2018-07-23 15:16:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:15,901 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 879 transitions. [2018-07-23 15:16:15,901 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 879 transitions. [2018-07-23 15:16:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:15,902 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:15,902 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:15,902 INFO L414 AbstractCegarLoop]: === Iteration 102 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1149501708, now seen corresponding path program 1 times [2018-07-23 15:16:15,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:15,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:15,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:15,912 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:15,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:15,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:15,913 INFO L87 Difference]: Start difference. First operand 530 states and 879 transitions. Second operand 10 states. [2018-07-23 15:16:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:16,460 INFO L93 Difference]: Finished difference Result 642 states and 1045 transitions. [2018-07-23 15:16:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:16:16,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:16,461 INFO L225 Difference]: With dead ends: 642 [2018-07-23 15:16:16,461 INFO L226 Difference]: Without dead ends: 640 [2018-07-23 15:16:16,461 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:16:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-07-23 15:16:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 524. [2018-07-23 15:16:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-07-23 15:16:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 869 transitions. [2018-07-23 15:16:16,850 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 869 transitions. Word has length 18 [2018-07-23 15:16:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:16,850 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 869 transitions. [2018-07-23 15:16:16,850 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 869 transitions. [2018-07-23 15:16:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:16,850 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:16,851 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:16,851 INFO L414 AbstractCegarLoop]: === Iteration 103 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1140912769, now seen corresponding path program 1 times [2018-07-23 15:16:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:16,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:16,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:16,863 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:16,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:16,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:16,864 INFO L87 Difference]: Start difference. First operand 524 states and 869 transitions. Second operand 10 states. [2018-07-23 15:16:17,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:17,369 INFO L93 Difference]: Finished difference Result 591 states and 958 transitions. [2018-07-23 15:16:17,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:16:17,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:17,370 INFO L225 Difference]: With dead ends: 591 [2018-07-23 15:16:17,370 INFO L226 Difference]: Without dead ends: 589 [2018-07-23 15:16:17,370 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:16:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-07-23 15:16:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 502. [2018-07-23 15:16:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-07-23 15:16:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 831 transitions. [2018-07-23 15:16:17,716 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 831 transitions. Word has length 18 [2018-07-23 15:16:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:17,717 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 831 transitions. [2018-07-23 15:16:17,717 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 831 transitions. [2018-07-23 15:16:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:16:17,717 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:17,717 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:17,717 INFO L414 AbstractCegarLoop]: === Iteration 104 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1070077282, now seen corresponding path program 1 times [2018-07-23 15:16:17,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:17,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:17,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:16:17,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:16:17,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:16:17,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:16:17,727 INFO L87 Difference]: Start difference. First operand 502 states and 831 transitions. Second operand 10 states. [2018-07-23 15:16:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:18,244 INFO L93 Difference]: Finished difference Result 576 states and 935 transitions. [2018-07-23 15:16:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:16:18,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:16:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:18,245 INFO L225 Difference]: With dead ends: 576 [2018-07-23 15:16:18,245 INFO L226 Difference]: Without dead ends: 574 [2018-07-23 15:16:18,246 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:16:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-07-23 15:16:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 490. [2018-07-23 15:16:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-07-23 15:16:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 811 transitions. [2018-07-23 15:16:18,588 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 811 transitions. Word has length 18 [2018-07-23 15:16:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:18,588 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 811 transitions. [2018-07-23 15:16:18,588 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:16:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 811 transitions. [2018-07-23 15:16:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:18,588 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:18,588 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:18,589 INFO L414 AbstractCegarLoop]: === Iteration 105 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash -850531879, now seen corresponding path program 3 times [2018-07-23 15:16:18,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:18,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:18,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:16:18,605 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:16:18,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:16:18,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:16:18,605 INFO L87 Difference]: Start difference. First operand 490 states and 811 transitions. Second operand 14 states. [2018-07-23 15:16:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:19,026 INFO L93 Difference]: Finished difference Result 502 states and 819 transitions. [2018-07-23 15:16:19,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:16:19,026 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 15:16:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:19,027 INFO L225 Difference]: With dead ends: 502 [2018-07-23 15:16:19,027 INFO L226 Difference]: Without dead ends: 501 [2018-07-23 15:16:19,027 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:16:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-23 15:16:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 454. [2018-07-23 15:16:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-07-23 15:16:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 750 transitions. [2018-07-23 15:16:19,361 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 750 transitions. Word has length 20 [2018-07-23 15:16:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:19,362 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 750 transitions. [2018-07-23 15:16:19,362 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:16:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 750 transitions. [2018-07-23 15:16:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:19,362 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:19,362 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:19,362 INFO L414 AbstractCegarLoop]: === Iteration 106 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1707385863, now seen corresponding path program 1 times [2018-07-23 15:16:19,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:19,378 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:19,378 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:16:19,379 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:16:19,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:16:19,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:16:19,379 INFO L87 Difference]: Start difference. First operand 454 states and 750 transitions. Second operand 14 states. [2018-07-23 15:16:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:19,891 INFO L93 Difference]: Finished difference Result 549 states and 901 transitions. [2018-07-23 15:16:19,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:16:19,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 15:16:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:19,892 INFO L225 Difference]: With dead ends: 549 [2018-07-23 15:16:19,893 INFO L226 Difference]: Without dead ends: 548 [2018-07-23 15:16:19,893 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:16:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-07-23 15:16:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 465. [2018-07-23 15:16:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-07-23 15:16:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 769 transitions. [2018-07-23 15:16:20,234 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 769 transitions. Word has length 20 [2018-07-23 15:16:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:20,234 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 769 transitions. [2018-07-23 15:16:20,234 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:16:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 769 transitions. [2018-07-23 15:16:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:20,235 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:20,235 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:20,235 INFO L414 AbstractCegarLoop]: === Iteration 107 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:20,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1999268581, now seen corresponding path program 2 times [2018-07-23 15:16:20,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:20,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:20,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:16:20,254 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:16:20,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:16:20,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:16:20,255 INFO L87 Difference]: Start difference. First operand 465 states and 769 transitions. Second operand 14 states. [2018-07-23 15:16:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:20,732 INFO L93 Difference]: Finished difference Result 510 states and 832 transitions. [2018-07-23 15:16:20,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:16:20,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 15:16:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:20,733 INFO L225 Difference]: With dead ends: 510 [2018-07-23 15:16:20,733 INFO L226 Difference]: Without dead ends: 508 [2018-07-23 15:16:20,733 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:16:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-07-23 15:16:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 449. [2018-07-23 15:16:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-07-23 15:16:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 743 transitions. [2018-07-23 15:16:21,151 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 743 transitions. Word has length 20 [2018-07-23 15:16:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:21,152 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 743 transitions. [2018-07-23 15:16:21,152 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:16:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 743 transitions. [2018-07-23 15:16:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:21,152 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:21,152 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:21,152 INFO L414 AbstractCegarLoop]: === Iteration 108 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1514664426, now seen corresponding path program 1 times [2018-07-23 15:16:21,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:21,169 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:21,169 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:21,169 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:21,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:21,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:21,170 INFO L87 Difference]: Start difference. First operand 449 states and 743 transitions. Second operand 13 states. [2018-07-23 15:16:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:21,769 INFO L93 Difference]: Finished difference Result 529 states and 854 transitions. [2018-07-23 15:16:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 15:16:21,770 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 15:16:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:21,770 INFO L225 Difference]: With dead ends: 529 [2018-07-23 15:16:21,770 INFO L226 Difference]: Without dead ends: 528 [2018-07-23 15:16:21,771 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:16:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-07-23 15:16:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 445. [2018-07-23 15:16:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-07-23 15:16:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 737 transitions. [2018-07-23 15:16:22,110 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 737 transitions. Word has length 20 [2018-07-23 15:16:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:22,110 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 737 transitions. [2018-07-23 15:16:22,110 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 737 transitions. [2018-07-23 15:16:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:22,111 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:22,111 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:22,111 INFO L414 AbstractCegarLoop]: === Iteration 109 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash -390222799, now seen corresponding path program 4 times [2018-07-23 15:16:22,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:22,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:22,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:16:22,128 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:16:22,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:16:22,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:16:22,128 INFO L87 Difference]: Start difference. First operand 445 states and 737 transitions. Second operand 15 states. [2018-07-23 15:16:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:22,711 INFO L93 Difference]: Finished difference Result 502 states and 814 transitions. [2018-07-23 15:16:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:16:22,711 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-07-23 15:16:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:22,711 INFO L225 Difference]: With dead ends: 502 [2018-07-23 15:16:22,712 INFO L226 Difference]: Without dead ends: 501 [2018-07-23 15:16:22,712 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:16:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-23 15:16:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 459. [2018-07-23 15:16:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-07-23 15:16:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 759 transitions. [2018-07-23 15:16:23,056 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 759 transitions. Word has length 20 [2018-07-23 15:16:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:23,056 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 759 transitions. [2018-07-23 15:16:23,056 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:16:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 759 transitions. [2018-07-23 15:16:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:23,056 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:23,056 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:23,056 INFO L414 AbstractCegarLoop]: === Iteration 110 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2059824409, now seen corresponding path program 2 times [2018-07-23 15:16:23,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:23,070 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:23,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:23,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:16:23,071 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:16:23,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:16:23,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:16:23,071 INFO L87 Difference]: Start difference. First operand 459 states and 759 transitions. Second operand 14 states. [2018-07-23 15:16:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:23,578 INFO L93 Difference]: Finished difference Result 521 states and 849 transitions. [2018-07-23 15:16:23,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:16:23,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 15:16:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:23,579 INFO L225 Difference]: With dead ends: 521 [2018-07-23 15:16:23,579 INFO L226 Difference]: Without dead ends: 520 [2018-07-23 15:16:23,579 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:16:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-07-23 15:16:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 489. [2018-07-23 15:16:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-07-23 15:16:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 808 transitions. [2018-07-23 15:16:23,950 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 808 transitions. Word has length 20 [2018-07-23 15:16:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:23,950 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 808 transitions. [2018-07-23 15:16:23,950 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:16:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 808 transitions. [2018-07-23 15:16:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:23,950 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:23,951 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:23,951 INFO L414 AbstractCegarLoop]: === Iteration 111 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash -781467557, now seen corresponding path program 1 times [2018-07-23 15:16:23,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:23,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:23,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:16:23,969 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:16:23,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:16:23,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:16:23,969 INFO L87 Difference]: Start difference. First operand 489 states and 808 transitions. Second operand 14 states. [2018-07-23 15:16:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:24,642 INFO L93 Difference]: Finished difference Result 578 states and 932 transitions. [2018-07-23 15:16:24,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:16:24,642 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 15:16:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:24,643 INFO L225 Difference]: With dead ends: 578 [2018-07-23 15:16:24,643 INFO L226 Difference]: Without dead ends: 576 [2018-07-23 15:16:24,644 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:16:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-07-23 15:16:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 493. [2018-07-23 15:16:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-07-23 15:16:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 815 transitions. [2018-07-23 15:16:25,022 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 815 transitions. Word has length 20 [2018-07-23 15:16:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:25,022 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 815 transitions. [2018-07-23 15:16:25,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:16:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 815 transitions. [2018-07-23 15:16:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:25,023 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:25,023 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:25,023 INFO L414 AbstractCegarLoop]: === Iteration 112 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:25,023 INFO L82 PathProgramCache]: Analyzing trace with hash -874261799, now seen corresponding path program 5 times [2018-07-23 15:16:25,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:25,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:25,042 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:16:25,043 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:16:25,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:16:25,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:16:25,043 INFO L87 Difference]: Start difference. First operand 493 states and 815 transitions. Second operand 15 states. [2018-07-23 15:16:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:25,834 INFO L93 Difference]: Finished difference Result 600 states and 981 transitions. [2018-07-23 15:16:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:16:25,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-07-23 15:16:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:25,835 INFO L225 Difference]: With dead ends: 600 [2018-07-23 15:16:25,835 INFO L226 Difference]: Without dead ends: 599 [2018-07-23 15:16:25,836 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:16:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-07-23 15:16:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 498. [2018-07-23 15:16:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-07-23 15:16:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 825 transitions. [2018-07-23 15:16:26,217 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 825 transitions. Word has length 20 [2018-07-23 15:16:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:26,217 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 825 transitions. [2018-07-23 15:16:26,217 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:16:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 825 transitions. [2018-07-23 15:16:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:26,217 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:26,218 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:26,218 INFO L414 AbstractCegarLoop]: === Iteration 113 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -872968933, now seen corresponding path program 2 times [2018-07-23 15:16:26,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:26,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:26,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:16:26,235 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:16:26,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:16:26,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:16:26,235 INFO L87 Difference]: Start difference. First operand 498 states and 825 transitions. Second operand 14 states. [2018-07-23 15:16:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:27,106 INFO L93 Difference]: Finished difference Result 829 states and 1342 transitions. [2018-07-23 15:16:27,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:16:27,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 15:16:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:27,107 INFO L225 Difference]: With dead ends: 829 [2018-07-23 15:16:27,107 INFO L226 Difference]: Without dead ends: 827 [2018-07-23 15:16:27,108 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:16:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-07-23 15:16:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 612. [2018-07-23 15:16:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-07-23 15:16:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1017 transitions. [2018-07-23 15:16:27,548 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1017 transitions. Word has length 20 [2018-07-23 15:16:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:27,548 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 1017 transitions. [2018-07-23 15:16:27,548 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:16:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1017 transitions. [2018-07-23 15:16:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:27,548 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:27,548 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:27,549 INFO L414 AbstractCegarLoop]: === Iteration 114 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1388091879, now seen corresponding path program 1 times [2018-07-23 15:16:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:27,569 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:27,569 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:27,569 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:27,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:27,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:27,569 INFO L87 Difference]: Start difference. First operand 612 states and 1017 transitions. Second operand 13 states. [2018-07-23 15:16:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:28,281 INFO L93 Difference]: Finished difference Result 696 states and 1138 transitions. [2018-07-23 15:16:28,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:16:28,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 15:16:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:28,282 INFO L225 Difference]: With dead ends: 696 [2018-07-23 15:16:28,282 INFO L226 Difference]: Without dead ends: 694 [2018-07-23 15:16:28,283 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:16:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-07-23 15:16:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 643. [2018-07-23 15:16:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-07-23 15:16:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1068 transitions. [2018-07-23 15:16:28,779 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1068 transitions. Word has length 20 [2018-07-23 15:16:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:28,779 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 1068 transitions. [2018-07-23 15:16:28,779 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1068 transitions. [2018-07-23 15:16:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:28,780 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:28,780 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:28,780 INFO L414 AbstractCegarLoop]: === Iteration 115 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash 149319872, now seen corresponding path program 3 times [2018-07-23 15:16:28,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:28,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:28,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:16:28,787 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:16:28,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:16:28,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:16:28,788 INFO L87 Difference]: Start difference. First operand 643 states and 1068 transitions. Second operand 7 states. [2018-07-23 15:16:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:29,924 INFO L93 Difference]: Finished difference Result 2025 states and 3340 transitions. [2018-07-23 15:16:29,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:16:29,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-23 15:16:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:29,926 INFO L225 Difference]: With dead ends: 2025 [2018-07-23 15:16:29,926 INFO L226 Difference]: Without dead ends: 1397 [2018-07-23 15:16:29,928 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:16:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2018-07-23 15:16:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1239. [2018-07-23 15:16:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-07-23 15:16:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2029 transitions. [2018-07-23 15:16:30,931 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2029 transitions. Word has length 20 [2018-07-23 15:16:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:30,931 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 2029 transitions. [2018-07-23 15:16:30,931 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:16:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2029 transitions. [2018-07-23 15:16:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:30,932 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:30,932 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:30,932 INFO L414 AbstractCegarLoop]: === Iteration 116 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1603097883, now seen corresponding path program 1 times [2018-07-23 15:16:30,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:30,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:30,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:30,957 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:30,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:30,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:30,958 INFO L87 Difference]: Start difference. First operand 1239 states and 2029 transitions. Second operand 13 states. [2018-07-23 15:16:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:32,178 INFO L93 Difference]: Finished difference Result 1356 states and 2197 transitions. [2018-07-23 15:16:32,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:16:32,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 15:16:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:32,180 INFO L225 Difference]: With dead ends: 1356 [2018-07-23 15:16:32,180 INFO L226 Difference]: Without dead ends: 1354 [2018-07-23 15:16:32,181 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:16:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-07-23 15:16:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1251. [2018-07-23 15:16:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2018-07-23 15:16:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2049 transitions. [2018-07-23 15:16:33,147 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2049 transitions. Word has length 20 [2018-07-23 15:16:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:33,147 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 2049 transitions. [2018-07-23 15:16:33,147 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2049 transitions. [2018-07-23 15:16:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:33,148 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:33,148 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:33,149 INFO L414 AbstractCegarLoop]: === Iteration 117 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1503357634, now seen corresponding path program 2 times [2018-07-23 15:16:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:33,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:33,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:33,173 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:33,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:33,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:33,174 INFO L87 Difference]: Start difference. First operand 1251 states and 2049 transitions. Second operand 13 states. [2018-07-23 15:16:34,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:34,452 INFO L93 Difference]: Finished difference Result 1410 states and 2292 transitions. [2018-07-23 15:16:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:16:34,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 15:16:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:34,454 INFO L225 Difference]: With dead ends: 1410 [2018-07-23 15:16:34,454 INFO L226 Difference]: Without dead ends: 1408 [2018-07-23 15:16:34,455 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:16:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-07-23 15:16:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1272. [2018-07-23 15:16:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-07-23 15:16:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2080 transitions. [2018-07-23 15:16:35,470 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2080 transitions. Word has length 20 [2018-07-23 15:16:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:35,470 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 2080 transitions. [2018-07-23 15:16:35,470 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2080 transitions. [2018-07-23 15:16:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:35,471 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:35,471 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:35,471 INFO L414 AbstractCegarLoop]: === Iteration 118 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:35,471 INFO L82 PathProgramCache]: Analyzing trace with hash 418443550, now seen corresponding path program 1 times [2018-07-23 15:16:35,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:35,484 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:35,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:35,484 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:35,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:35,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:35,484 INFO L87 Difference]: Start difference. First operand 1272 states and 2080 transitions. Second operand 13 states. [2018-07-23 15:16:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:36,616 INFO L93 Difference]: Finished difference Result 1365 states and 2218 transitions. [2018-07-23 15:16:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:16:36,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 15:16:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:36,618 INFO L225 Difference]: With dead ends: 1365 [2018-07-23 15:16:36,618 INFO L226 Difference]: Without dead ends: 1364 [2018-07-23 15:16:36,618 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:16:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-07-23 15:16:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1342. [2018-07-23 15:16:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-07-23 15:16:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2190 transitions. [2018-07-23 15:16:37,705 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2190 transitions. Word has length 20 [2018-07-23 15:16:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:37,705 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 2190 transitions. [2018-07-23 15:16:37,705 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2190 transitions. [2018-07-23 15:16:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:37,706 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:37,706 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:37,707 INFO L414 AbstractCegarLoop]: === Iteration 119 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1962310520, now seen corresponding path program 4 times [2018-07-23 15:16:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 15:16:37,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:37,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:16:37,715 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:16:37,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:16:37,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:16:37,716 INFO L87 Difference]: Start difference. First operand 1342 states and 2190 transitions. Second operand 7 states. [2018-07-23 15:16:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:39,231 INFO L93 Difference]: Finished difference Result 2545 states and 4127 transitions. [2018-07-23 15:16:39,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:16:39,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-23 15:16:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:39,233 INFO L225 Difference]: With dead ends: 2545 [2018-07-23 15:16:39,233 INFO L226 Difference]: Without dead ends: 1760 [2018-07-23 15:16:39,235 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2018-07-23 15:16:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1331. [2018-07-23 15:16:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-07-23 15:16:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2166 transitions. [2018-07-23 15:16:40,363 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2166 transitions. Word has length 20 [2018-07-23 15:16:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:40,363 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 2166 transitions. [2018-07-23 15:16:40,363 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:16:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2166 transitions. [2018-07-23 15:16:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:40,364 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:40,364 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:40,364 INFO L414 AbstractCegarLoop]: === Iteration 120 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1797340462, now seen corresponding path program 1 times [2018-07-23 15:16:40,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:40,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:40,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:16:40,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:16:40,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:16:40,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:16:40,376 INFO L87 Difference]: Start difference. First operand 1331 states and 2166 transitions. Second operand 12 states. [2018-07-23 15:16:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:41,869 INFO L93 Difference]: Finished difference Result 1610 states and 2608 transitions. [2018-07-23 15:16:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:16:41,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 15:16:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:41,871 INFO L225 Difference]: With dead ends: 1610 [2018-07-23 15:16:41,871 INFO L226 Difference]: Without dead ends: 1608 [2018-07-23 15:16:41,871 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:16:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-07-23 15:16:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1436. [2018-07-23 15:16:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2018-07-23 15:16:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2341 transitions. [2018-07-23 15:16:43,184 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2341 transitions. Word has length 20 [2018-07-23 15:16:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:43,184 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2341 transitions. [2018-07-23 15:16:43,184 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:16:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2341 transitions. [2018-07-23 15:16:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:43,185 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:43,185 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:43,185 INFO L414 AbstractCegarLoop]: === Iteration 121 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -70738496, now seen corresponding path program 5 times [2018-07-23 15:16:43,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 15:16:43,194 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:43,194 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:16:43,194 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:16:43,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:16:43,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:16:43,195 INFO L87 Difference]: Start difference. First operand 1436 states and 2341 transitions. Second operand 7 states. [2018-07-23 15:16:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:44,868 INFO L93 Difference]: Finished difference Result 2745 states and 4471 transitions. [2018-07-23 15:16:44,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:16:44,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-23 15:16:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:44,870 INFO L225 Difference]: With dead ends: 2745 [2018-07-23 15:16:44,870 INFO L226 Difference]: Without dead ends: 1823 [2018-07-23 15:16:44,872 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:16:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2018-07-23 15:16:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1657. [2018-07-23 15:16:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2018-07-23 15:16:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2701 transitions. [2018-07-23 15:16:46,306 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2701 transitions. Word has length 20 [2018-07-23 15:16:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:46,306 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2701 transitions. [2018-07-23 15:16:46,306 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:16:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2701 transitions. [2018-07-23 15:16:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:46,307 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:46,307 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:46,307 INFO L414 AbstractCegarLoop]: === Iteration 122 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -70737726, now seen corresponding path program 2 times [2018-07-23 15:16:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:46,319 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:46,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:16:46,319 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:16:46,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:16:46,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:16:46,320 INFO L87 Difference]: Start difference. First operand 1657 states and 2701 transitions. Second operand 12 states. [2018-07-23 15:16:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:48,037 INFO L93 Difference]: Finished difference Result 1815 states and 2934 transitions. [2018-07-23 15:16:48,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:16:48,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 15:16:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:48,039 INFO L225 Difference]: With dead ends: 1815 [2018-07-23 15:16:48,039 INFO L226 Difference]: Without dead ends: 1813 [2018-07-23 15:16:48,040 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:16:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-07-23 15:16:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1651. [2018-07-23 15:16:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-07-23 15:16:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2690 transitions. [2018-07-23 15:16:49,491 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2690 transitions. Word has length 20 [2018-07-23 15:16:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:49,491 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2690 transitions. [2018-07-23 15:16:49,491 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:16:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2690 transitions. [2018-07-23 15:16:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:49,492 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:49,492 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:49,492 INFO L414 AbstractCegarLoop]: === Iteration 123 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash 56099968, now seen corresponding path program 1 times [2018-07-23 15:16:49,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:49,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:49,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:49,514 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:49,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:49,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:49,514 INFO L87 Difference]: Start difference. First operand 1651 states and 2690 transitions. Second operand 13 states. [2018-07-23 15:16:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:51,172 INFO L93 Difference]: Finished difference Result 1804 states and 2922 transitions. [2018-07-23 15:16:51,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:16:51,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 15:16:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:51,174 INFO L225 Difference]: With dead ends: 1804 [2018-07-23 15:16:51,174 INFO L226 Difference]: Without dead ends: 1802 [2018-07-23 15:16:51,174 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:16:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-07-23 15:16:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1635. [2018-07-23 15:16:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-07-23 15:16:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2664 transitions. [2018-07-23 15:16:52,571 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2664 transitions. Word has length 20 [2018-07-23 15:16:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:52,571 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2664 transitions. [2018-07-23 15:16:52,571 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2664 transitions. [2018-07-23 15:16:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:52,572 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:52,572 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:52,572 INFO L414 AbstractCegarLoop]: === Iteration 124 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1028814116, now seen corresponding path program 1 times [2018-07-23 15:16:52,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:52,589 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:52,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:16:52,589 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:16:52,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:16:52,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:16:52,590 INFO L87 Difference]: Start difference. First operand 1635 states and 2664 transitions. Second operand 13 states. [2018-07-23 15:16:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:54,427 INFO L93 Difference]: Finished difference Result 1702 states and 2762 transitions. [2018-07-23 15:16:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:16:54,427 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-23 15:16:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:54,429 INFO L225 Difference]: With dead ends: 1702 [2018-07-23 15:16:54,429 INFO L226 Difference]: Without dead ends: 1701 [2018-07-23 15:16:54,429 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:16:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2018-07-23 15:16:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1631. [2018-07-23 15:16:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-07-23 15:16:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2657 transitions. [2018-07-23 15:16:55,817 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2657 transitions. Word has length 20 [2018-07-23 15:16:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:55,817 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2657 transitions. [2018-07-23 15:16:55,817 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:16:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2657 transitions. [2018-07-23 15:16:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:55,818 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:55,818 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:55,818 INFO L414 AbstractCegarLoop]: === Iteration 125 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash 294164016, now seen corresponding path program 1 times [2018-07-23 15:16:55,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:55,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:55,832 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:16:55,832 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:16:55,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:16:55,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:16:55,832 INFO L87 Difference]: Start difference. First operand 1631 states and 2657 transitions. Second operand 12 states. [2018-07-23 15:16:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:16:57,682 INFO L93 Difference]: Finished difference Result 1884 states and 3067 transitions. [2018-07-23 15:16:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:16:57,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-23 15:16:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:16:57,684 INFO L225 Difference]: With dead ends: 1884 [2018-07-23 15:16:57,685 INFO L226 Difference]: Without dead ends: 1883 [2018-07-23 15:16:57,685 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:16:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-07-23 15:16:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1605. [2018-07-23 15:16:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-07-23 15:16:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2615 transitions. [2018-07-23 15:16:59,041 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2615 transitions. Word has length 20 [2018-07-23 15:16:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:16:59,041 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 2615 transitions. [2018-07-23 15:16:59,041 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:16:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2615 transitions. [2018-07-23 15:16:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:16:59,042 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:16:59,042 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:16:59,042 INFO L414 AbstractCegarLoop]: === Iteration 126 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:16:59,042 INFO L82 PathProgramCache]: Analyzing trace with hash -503083984, now seen corresponding path program 1 times [2018-07-23 15:16:59,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:16:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:16:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:16:59,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:16:59,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:16:59,055 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:16:59,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:16:59,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:16:59,055 INFO L87 Difference]: Start difference. First operand 1605 states and 2615 transitions. Second operand 14 states. [2018-07-23 15:17:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:00,796 INFO L93 Difference]: Finished difference Result 1872 states and 3057 transitions. [2018-07-23 15:17:00,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:17:00,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-23 15:17:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:00,798 INFO L225 Difference]: With dead ends: 1872 [2018-07-23 15:17:00,798 INFO L226 Difference]: Without dead ends: 1871 [2018-07-23 15:17:00,799 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:17:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-07-23 15:17:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1694. [2018-07-23 15:17:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2018-07-23 15:17:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2762 transitions. [2018-07-23 15:17:02,231 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2762 transitions. Word has length 20 [2018-07-23 15:17:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:02,231 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2762 transitions. [2018-07-23 15:17:02,231 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:17:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2762 transitions. [2018-07-23 15:17:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 15:17:02,232 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:02,232 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:02,233 INFO L414 AbstractCegarLoop]: === Iteration 127 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:02,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1843127659, now seen corresponding path program 1 times [2018-07-23 15:17:02,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:02,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:02,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:17:02,244 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:17:02,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:17:02,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:17:02,244 INFO L87 Difference]: Start difference. First operand 1694 states and 2762 transitions. Second operand 12 states. [2018-07-23 15:17:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:03,889 INFO L93 Difference]: Finished difference Result 1818 states and 2952 transitions. [2018-07-23 15:17:03,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:17:03,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 15:17:03,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:03,892 INFO L225 Difference]: With dead ends: 1818 [2018-07-23 15:17:03,893 INFO L226 Difference]: Without dead ends: 1816 [2018-07-23 15:17:03,893 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:17:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2018-07-23 15:17:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1702. [2018-07-23 15:17:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-07-23 15:17:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2774 transitions. [2018-07-23 15:17:05,380 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2774 transitions. Word has length 21 [2018-07-23 15:17:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:05,380 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2774 transitions. [2018-07-23 15:17:05,380 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:17:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2774 transitions. [2018-07-23 15:17:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 15:17:05,382 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:05,382 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:05,382 INFO L414 AbstractCegarLoop]: === Iteration 128 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:05,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1652448723, now seen corresponding path program 1 times [2018-07-23 15:17:05,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:05,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:05,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:17:05,407 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:17:05,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:17:05,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:17:05,408 INFO L87 Difference]: Start difference. First operand 1702 states and 2774 transitions. Second operand 12 states. [2018-07-23 15:17:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:07,136 INFO L93 Difference]: Finished difference Result 1906 states and 3103 transitions. [2018-07-23 15:17:07,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:17:07,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 15:17:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:07,139 INFO L225 Difference]: With dead ends: 1906 [2018-07-23 15:17:07,139 INFO L226 Difference]: Without dead ends: 1904 [2018-07-23 15:17:07,140 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:17:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-07-23 15:17:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1715. [2018-07-23 15:17:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-07-23 15:17:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2795 transitions. [2018-07-23 15:17:08,618 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2795 transitions. Word has length 21 [2018-07-23 15:17:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:08,618 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2795 transitions. [2018-07-23 15:17:08,618 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:17:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2795 transitions. [2018-07-23 15:17:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 15:17:08,620 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:08,620 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:08,620 INFO L414 AbstractCegarLoop]: === Iteration 129 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:08,620 INFO L82 PathProgramCache]: Analyzing trace with hash -858694805, now seen corresponding path program 1 times [2018-07-23 15:17:08,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:08,631 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:08,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:17:08,631 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:17:08,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:17:08,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:17:08,632 INFO L87 Difference]: Start difference. First operand 1715 states and 2795 transitions. Second operand 12 states. [2018-07-23 15:17:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:10,486 INFO L93 Difference]: Finished difference Result 1953 states and 3181 transitions. [2018-07-23 15:17:10,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:17:10,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-23 15:17:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:10,488 INFO L225 Difference]: With dead ends: 1953 [2018-07-23 15:17:10,489 INFO L226 Difference]: Without dead ends: 1951 [2018-07-23 15:17:10,489 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:17:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-07-23 15:17:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1700. [2018-07-23 15:17:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2018-07-23 15:17:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2771 transitions. [2018-07-23 15:17:12,012 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2771 transitions. Word has length 21 [2018-07-23 15:17:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:12,012 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2771 transitions. [2018-07-23 15:17:12,013 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:17:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2771 transitions. [2018-07-23 15:17:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:12,014 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:12,014 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 15:17:12,014 INFO L414 AbstractCegarLoop]: === Iteration 130 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash -119563298, now seen corresponding path program 3 times [2018-07-23 15:17:12,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:12,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:12,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:17:12,039 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:17:12,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:17:12,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:17:12,040 INFO L87 Difference]: Start difference. First operand 1700 states and 2771 transitions. Second operand 16 states. [2018-07-23 15:17:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:13,775 INFO L93 Difference]: Finished difference Result 1765 states and 2860 transitions. [2018-07-23 15:17:13,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:17:13,775 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-23 15:17:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:13,777 INFO L225 Difference]: With dead ends: 1765 [2018-07-23 15:17:13,777 INFO L226 Difference]: Without dead ends: 1764 [2018-07-23 15:17:13,778 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:17:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-07-23 15:17:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1611. [2018-07-23 15:17:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-07-23 15:17:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2624 transitions. [2018-07-23 15:17:15,214 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2624 transitions. Word has length 22 [2018-07-23 15:17:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:15,214 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2624 transitions. [2018-07-23 15:17:15,214 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:17:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2624 transitions. [2018-07-23 15:17:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:15,215 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:15,215 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 15:17:15,215 INFO L414 AbstractCegarLoop]: === Iteration 131 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 489410380, now seen corresponding path program 4 times [2018-07-23 15:17:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:15,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:15,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:17:15,240 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:17:15,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:17:15,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:17:15,240 INFO L87 Difference]: Start difference. First operand 1611 states and 2624 transitions. Second operand 16 states. [2018-07-23 15:17:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:16,997 INFO L93 Difference]: Finished difference Result 1706 states and 2757 transitions. [2018-07-23 15:17:16,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 15:17:16,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-23 15:17:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:16,999 INFO L225 Difference]: With dead ends: 1706 [2018-07-23 15:17:16,999 INFO L226 Difference]: Without dead ends: 1705 [2018-07-23 15:17:17,000 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:17:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2018-07-23 15:17:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1607. [2018-07-23 15:17:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2018-07-23 15:17:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2615 transitions. [2018-07-23 15:17:18,413 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2615 transitions. Word has length 22 [2018-07-23 15:17:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:18,414 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2615 transitions. [2018-07-23 15:17:18,414 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:17:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2615 transitions. [2018-07-23 15:17:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:18,415 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:18,415 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:18,415 INFO L414 AbstractCegarLoop]: === Iteration 132 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1161738932, now seen corresponding path program 2 times [2018-07-23 15:17:18,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:18,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:18,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:17:18,436 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:17:18,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:17:18,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:17:18,437 INFO L87 Difference]: Start difference. First operand 1607 states and 2615 transitions. Second operand 15 states. [2018-07-23 15:17:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:20,059 INFO L93 Difference]: Finished difference Result 1768 states and 2871 transitions. [2018-07-23 15:17:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:17:20,060 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-23 15:17:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:20,062 INFO L225 Difference]: With dead ends: 1768 [2018-07-23 15:17:20,062 INFO L226 Difference]: Without dead ends: 1767 [2018-07-23 15:17:20,062 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:17:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-07-23 15:17:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1649. [2018-07-23 15:17:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2018-07-23 15:17:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2685 transitions. [2018-07-23 15:17:21,529 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2685 transitions. Word has length 22 [2018-07-23 15:17:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:21,530 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2685 transitions. [2018-07-23 15:17:21,530 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:17:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2685 transitions. [2018-07-23 15:17:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:21,531 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:21,531 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 15:17:21,531 INFO L414 AbstractCegarLoop]: === Iteration 133 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1611878626, now seen corresponding path program 5 times [2018-07-23 15:17:21,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:21,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:21,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:17:21,557 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:17:21,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:17:21,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:17:21,558 INFO L87 Difference]: Start difference. First operand 1649 states and 2685 transitions. Second operand 16 states. [2018-07-23 15:17:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:23,775 INFO L93 Difference]: Finished difference Result 1995 states and 3219 transitions. [2018-07-23 15:17:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 15:17:23,775 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-23 15:17:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:23,777 INFO L225 Difference]: With dead ends: 1995 [2018-07-23 15:17:23,778 INFO L226 Difference]: Without dead ends: 1994 [2018-07-23 15:17:23,778 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=347, Invalid=2203, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:17:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-07-23 15:17:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1676. [2018-07-23 15:17:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2018-07-23 15:17:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2732 transitions. [2018-07-23 15:17:25,317 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2732 transitions. Word has length 22 [2018-07-23 15:17:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:25,317 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2732 transitions. [2018-07-23 15:17:25,318 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:17:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2732 transitions. [2018-07-23 15:17:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:25,319 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:25,319 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:25,319 INFO L414 AbstractCegarLoop]: === Iteration 134 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:25,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1825100773, now seen corresponding path program 1 times [2018-07-23 15:17:25,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:25,336 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:25,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:17:25,336 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:17:25,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:17:25,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:17:25,337 INFO L87 Difference]: Start difference. First operand 1676 states and 2732 transitions. Second operand 15 states. [2018-07-23 15:17:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:27,253 INFO L93 Difference]: Finished difference Result 1916 states and 3112 transitions. [2018-07-23 15:17:27,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:17:27,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-23 15:17:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:27,255 INFO L225 Difference]: With dead ends: 1916 [2018-07-23 15:17:27,256 INFO L226 Difference]: Without dead ends: 1914 [2018-07-23 15:17:27,256 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:17:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2018-07-23 15:17:28,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1767. [2018-07-23 15:17:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-07-23 15:17:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2876 transitions. [2018-07-23 15:17:28,912 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2876 transitions. Word has length 22 [2018-07-23 15:17:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2876 transitions. [2018-07-23 15:17:28,912 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:17:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2876 transitions. [2018-07-23 15:17:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:28,913 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:28,913 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:28,913 INFO L414 AbstractCegarLoop]: === Iteration 135 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1601377053, now seen corresponding path program 1 times [2018-07-23 15:17:28,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:28,929 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:28,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:17:28,929 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:17:28,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:17:28,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:17:28,929 INFO L87 Difference]: Start difference. First operand 1767 states and 2876 transitions. Second operand 14 states. [2018-07-23 15:17:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:30,630 INFO L93 Difference]: Finished difference Result 1874 states and 3046 transitions. [2018-07-23 15:17:30,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:17:30,630 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-23 15:17:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:30,632 INFO L225 Difference]: With dead ends: 1874 [2018-07-23 15:17:30,632 INFO L226 Difference]: Without dead ends: 1873 [2018-07-23 15:17:30,633 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:17:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-07-23 15:17:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1763. [2018-07-23 15:17:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2018-07-23 15:17:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2871 transitions. [2018-07-23 15:17:32,248 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2871 transitions. Word has length 22 [2018-07-23 15:17:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:32,249 INFO L471 AbstractCegarLoop]: Abstraction has 1763 states and 2871 transitions. [2018-07-23 15:17:32,249 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:17:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2871 transitions. [2018-07-23 15:17:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:32,250 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:32,250 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:32,250 INFO L414 AbstractCegarLoop]: === Iteration 136 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1715079645, now seen corresponding path program 1 times [2018-07-23 15:17:32,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:32,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:32,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:17:32,268 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:17:32,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:17:32,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:17:32,269 INFO L87 Difference]: Start difference. First operand 1763 states and 2871 transitions. Second operand 15 states. [2018-07-23 15:17:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:34,291 INFO L93 Difference]: Finished difference Result 1970 states and 3194 transitions. [2018-07-23 15:17:34,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:17:34,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-23 15:17:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:34,294 INFO L225 Difference]: With dead ends: 1970 [2018-07-23 15:17:34,294 INFO L226 Difference]: Without dead ends: 1968 [2018-07-23 15:17:34,294 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=1261, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:17:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-07-23 15:17:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1712. [2018-07-23 15:17:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2018-07-23 15:17:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2788 transitions. [2018-07-23 15:17:35,882 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2788 transitions. Word has length 22 [2018-07-23 15:17:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:35,883 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2788 transitions. [2018-07-23 15:17:35,883 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:17:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2788 transitions. [2018-07-23 15:17:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:35,884 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:35,884 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-23 15:17:35,884 INFO L414 AbstractCegarLoop]: === Iteration 137 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:35,884 INFO L82 PathProgramCache]: Analyzing trace with hash -846590175, now seen corresponding path program 3 times [2018-07-23 15:17:35,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:35,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:35,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:17:35,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:17:35,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:17:35,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:17:35,905 INFO L87 Difference]: Start difference. First operand 1712 states and 2788 transitions. Second operand 14 states. [2018-07-23 15:17:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:37,821 INFO L93 Difference]: Finished difference Result 1872 states and 3041 transitions. [2018-07-23 15:17:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:17:37,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-23 15:17:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:37,823 INFO L225 Difference]: With dead ends: 1872 [2018-07-23 15:17:37,823 INFO L226 Difference]: Without dead ends: 1871 [2018-07-23 15:17:37,823 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:17:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-07-23 15:17:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1656. [2018-07-23 15:17:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-07-23 15:17:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2697 transitions. [2018-07-23 15:17:39,330 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2697 transitions. Word has length 22 [2018-07-23 15:17:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:39,330 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2697 transitions. [2018-07-23 15:17:39,330 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:17:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2697 transitions. [2018-07-23 15:17:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:17:39,331 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:39,331 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:39,331 INFO L414 AbstractCegarLoop]: === Iteration 138 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1868893045, now seen corresponding path program 2 times [2018-07-23 15:17:39,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:39,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:39,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:17:39,350 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:17:39,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:17:39,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:17:39,351 INFO L87 Difference]: Start difference. First operand 1656 states and 2697 transitions. Second operand 15 states. [2018-07-23 15:17:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:41,117 INFO L93 Difference]: Finished difference Result 1826 states and 2973 transitions. [2018-07-23 15:17:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:17:41,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-23 15:17:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:41,119 INFO L225 Difference]: With dead ends: 1826 [2018-07-23 15:17:41,120 INFO L226 Difference]: Without dead ends: 1825 [2018-07-23 15:17:41,120 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:17:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2018-07-23 15:17:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1527. [2018-07-23 15:17:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2018-07-23 15:17:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2487 transitions. [2018-07-23 15:17:42,551 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2487 transitions. Word has length 22 [2018-07-23 15:17:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:42,551 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 2487 transitions. [2018-07-23 15:17:42,551 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:17:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2487 transitions. [2018-07-23 15:17:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:17:42,552 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:42,552 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:42,553 INFO L414 AbstractCegarLoop]: === Iteration 139 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash 441602332, now seen corresponding path program 1 times [2018-07-23 15:17:42,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:42,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:42,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:17:42,565 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:17:42,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:17:42,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:17:42,566 INFO L87 Difference]: Start difference. First operand 1527 states and 2487 transitions. Second operand 14 states. [2018-07-23 15:17:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:44,200 INFO L93 Difference]: Finished difference Result 1634 states and 2653 transitions. [2018-07-23 15:17:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:17:44,200 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 15:17:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:44,202 INFO L225 Difference]: With dead ends: 1634 [2018-07-23 15:17:44,202 INFO L226 Difference]: Without dead ends: 1633 [2018-07-23 15:17:44,203 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:17:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-07-23 15:17:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1575. [2018-07-23 15:17:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-07-23 15:17:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-07-23 15:17:45,674 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-07-23 15:17:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:45,674 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-07-23 15:17:45,674 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:17:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-07-23 15:17:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:17:45,675 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:45,675 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:45,675 INFO L414 AbstractCegarLoop]: === Iteration 140 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1719959184, now seen corresponding path program 1 times [2018-07-23 15:17:45,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:45,696 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:45,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:17:45,696 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:17:45,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:17:45,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:17:45,697 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-07-23 15:17:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:47,533 INFO L93 Difference]: Finished difference Result 1685 states and 2725 transitions. [2018-07-23 15:17:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:17:47,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 15:17:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:47,534 INFO L225 Difference]: With dead ends: 1685 [2018-07-23 15:17:47,534 INFO L226 Difference]: Without dead ends: 1683 [2018-07-23 15:17:47,535 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:17:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-07-23 15:17:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1575. [2018-07-23 15:17:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-07-23 15:17:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-07-23 15:17:49,007 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-07-23 15:17:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:49,007 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-07-23 15:17:49,007 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:17:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-07-23 15:17:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:17:49,008 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:49,008 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:49,008 INFO L414 AbstractCegarLoop]: === Iteration 141 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1628457808, now seen corresponding path program 2 times [2018-07-23 15:17:49,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:49,021 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:49,021 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:17:49,021 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:17:49,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:17:49,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:17:49,021 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-07-23 15:17:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:51,143 INFO L93 Difference]: Finished difference Result 2088 states and 3396 transitions. [2018-07-23 15:17:51,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 15:17:51,143 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 15:17:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:51,145 INFO L225 Difference]: With dead ends: 2088 [2018-07-23 15:17:51,145 INFO L226 Difference]: Without dead ends: 2086 [2018-07-23 15:17:51,146 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=399, Invalid=2151, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:17:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2018-07-23 15:17:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1710. [2018-07-23 15:17:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2018-07-23 15:17:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2793 transitions. [2018-07-23 15:17:52,738 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2793 transitions. Word has length 23 [2018-07-23 15:17:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:52,738 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2793 transitions. [2018-07-23 15:17:52,738 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:17:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2793 transitions. [2018-07-23 15:17:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:17:52,739 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:52,739 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:52,739 INFO L414 AbstractCegarLoop]: === Iteration 142 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1349164405, now seen corresponding path program 3 times [2018-07-23 15:17:52,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:52,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:52,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:17:52,754 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:17:52,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:17:52,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:17:52,755 INFO L87 Difference]: Start difference. First operand 1710 states and 2793 transitions. Second operand 16 states. [2018-07-23 15:17:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:54,559 INFO L93 Difference]: Finished difference Result 1839 states and 2998 transitions. [2018-07-23 15:17:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:17:54,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-23 15:17:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:54,562 INFO L225 Difference]: With dead ends: 1839 [2018-07-23 15:17:54,562 INFO L226 Difference]: Without dead ends: 1838 [2018-07-23 15:17:54,562 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:17:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-07-23 15:17:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1750. [2018-07-23 15:17:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-07-23 15:17:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2860 transitions. [2018-07-23 15:17:56,114 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2860 transitions. Word has length 23 [2018-07-23 15:17:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:56,114 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2860 transitions. [2018-07-23 15:17:56,114 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:17:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2860 transitions. [2018-07-23 15:17:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:17:56,115 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:56,115 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:56,115 INFO L414 AbstractCegarLoop]: === Iteration 143 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1977166985, now seen corresponding path program 1 times [2018-07-23 15:17:56,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:56,132 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:56,132 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:17:56,132 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:17:56,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:17:56,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:17:56,133 INFO L87 Difference]: Start difference. First operand 1750 states and 2860 transitions. Second operand 15 states. [2018-07-23 15:17:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:17:58,062 INFO L93 Difference]: Finished difference Result 1875 states and 3050 transitions. [2018-07-23 15:17:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:17:58,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-23 15:17:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:17:58,065 INFO L225 Difference]: With dead ends: 1875 [2018-07-23 15:17:58,065 INFO L226 Difference]: Without dead ends: 1873 [2018-07-23 15:17:58,066 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:17:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-07-23 15:17:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1738. [2018-07-23 15:17:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2018-07-23 15:17:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2840 transitions. [2018-07-23 15:17:59,666 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2840 transitions. Word has length 23 [2018-07-23 15:17:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:17:59,666 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2840 transitions. [2018-07-23 15:17:59,666 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:17:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2840 transitions. [2018-07-23 15:17:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:17:59,667 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:17:59,667 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:17:59,667 INFO L414 AbstractCegarLoop]: === Iteration 144 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:17:59,667 INFO L82 PathProgramCache]: Analyzing trace with hash -451471923, now seen corresponding path program 4 times [2018-07-23 15:17:59,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:17:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:17:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:17:59,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:17:59,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:17:59,681 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:17:59,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:17:59,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:17:59,682 INFO L87 Difference]: Start difference. First operand 1738 states and 2840 transitions. Second operand 16 states. [2018-07-23 15:18:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:01,615 INFO L93 Difference]: Finished difference Result 1956 states and 3208 transitions. [2018-07-23 15:18:01,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:18:01,616 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-23 15:18:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:01,618 INFO L225 Difference]: With dead ends: 1956 [2018-07-23 15:18:01,618 INFO L226 Difference]: Without dead ends: 1955 [2018-07-23 15:18:01,619 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:18:01,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-07-23 15:18:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1711. [2018-07-23 15:18:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2018-07-23 15:18:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2797 transitions. [2018-07-23 15:18:03,167 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2797 transitions. Word has length 23 [2018-07-23 15:18:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:03,167 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2797 transitions. [2018-07-23 15:18:03,167 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:18:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2797 transitions. [2018-07-23 15:18:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:03,168 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:03,168 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:03,168 INFO L414 AbstractCegarLoop]: === Iteration 145 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:03,168 INFO L82 PathProgramCache]: Analyzing trace with hash -451472211, now seen corresponding path program 2 times [2018-07-23 15:18:03,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:03,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:03,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:18:03,187 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:18:03,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:18:03,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:18:03,187 INFO L87 Difference]: Start difference. First operand 1711 states and 2797 transitions. Second operand 14 states. [2018-07-23 15:18:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:05,157 INFO L93 Difference]: Finished difference Result 1914 states and 3100 transitions. [2018-07-23 15:18:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:18:05,157 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 15:18:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:05,159 INFO L225 Difference]: With dead ends: 1914 [2018-07-23 15:18:05,159 INFO L226 Difference]: Without dead ends: 1912 [2018-07-23 15:18:05,160 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:18:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-07-23 15:18:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1723. [2018-07-23 15:18:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-07-23 15:18:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-07-23 15:18:06,754 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 23 [2018-07-23 15:18:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:06,754 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-07-23 15:18:06,755 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:18:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-07-23 15:18:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:06,755 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:06,756 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:06,756 INFO L414 AbstractCegarLoop]: === Iteration 146 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash -590426441, now seen corresponding path program 2 times [2018-07-23 15:18:06,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:06,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:06,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:18:06,771 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:18:06,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:18:06,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:18:06,772 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 15 states. [2018-07-23 15:18:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:08,871 INFO L93 Difference]: Finished difference Result 1923 states and 3105 transitions. [2018-07-23 15:18:08,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:18:08,871 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-23 15:18:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:08,873 INFO L225 Difference]: With dead ends: 1923 [2018-07-23 15:18:08,873 INFO L226 Difference]: Without dead ends: 1921 [2018-07-23 15:18:08,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:18:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-07-23 15:18:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1745. [2018-07-23 15:18:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2018-07-23 15:18:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2845 transitions. [2018-07-23 15:18:10,507 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2845 transitions. Word has length 23 [2018-07-23 15:18:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:10,507 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2845 transitions. [2018-07-23 15:18:10,507 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:18:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2845 transitions. [2018-07-23 15:18:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:10,508 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:10,508 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:10,508 INFO L414 AbstractCegarLoop]: === Iteration 147 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1677111747, now seen corresponding path program 3 times [2018-07-23 15:18:10,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:10,521 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:10,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:18:10,522 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:18:10,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:18:10,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:18:10,522 INFO L87 Difference]: Start difference. First operand 1745 states and 2845 transitions. Second operand 14 states. [2018-07-23 15:18:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:12,843 INFO L93 Difference]: Finished difference Result 2195 states and 3566 transitions. [2018-07-23 15:18:12,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:18:12,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 15:18:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:12,845 INFO L225 Difference]: With dead ends: 2195 [2018-07-23 15:18:12,845 INFO L226 Difference]: Without dead ends: 2193 [2018-07-23 15:18:12,846 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:18:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-07-23 15:18:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1652. [2018-07-23 15:18:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-07-23 15:18:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2691 transitions. [2018-07-23 15:18:14,505 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2691 transitions. Word has length 23 [2018-07-23 15:18:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:14,505 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2691 transitions. [2018-07-23 15:18:14,505 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:18:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2691 transitions. [2018-07-23 15:18:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:14,506 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:14,506 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:14,506 INFO L414 AbstractCegarLoop]: === Iteration 148 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash 170792271, now seen corresponding path program 2 times [2018-07-23 15:18:14,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:14,527 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:14,528 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:18:14,528 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:18:14,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:18:14,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:18:14,528 INFO L87 Difference]: Start difference. First operand 1652 states and 2691 transitions. Second operand 16 states. [2018-07-23 15:18:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:16,659 INFO L93 Difference]: Finished difference Result 1928 states and 3135 transitions. [2018-07-23 15:18:16,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:18:16,659 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-23 15:18:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:16,662 INFO L225 Difference]: With dead ends: 1928 [2018-07-23 15:18:16,662 INFO L226 Difference]: Without dead ends: 1927 [2018-07-23 15:18:16,662 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:18:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2018-07-23 15:18:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1651. [2018-07-23 15:18:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-07-23 15:18:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2684 transitions. [2018-07-23 15:18:18,313 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2684 transitions. Word has length 23 [2018-07-23 15:18:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:18,313 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2684 transitions. [2018-07-23 15:18:18,313 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:18:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2684 transitions. [2018-07-23 15:18:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:18,314 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:18,314 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:18,314 INFO L414 AbstractCegarLoop]: === Iteration 149 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash 170791983, now seen corresponding path program 4 times [2018-07-23 15:18:18,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:18,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:18,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:18:18,329 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:18:18,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:18:18,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:18:18,329 INFO L87 Difference]: Start difference. First operand 1651 states and 2684 transitions. Second operand 14 states. [2018-07-23 15:18:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:20,500 INFO L93 Difference]: Finished difference Result 1899 states and 3045 transitions. [2018-07-23 15:18:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:18:20,500 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 15:18:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:20,502 INFO L225 Difference]: With dead ends: 1899 [2018-07-23 15:18:20,503 INFO L226 Difference]: Without dead ends: 1897 [2018-07-23 15:18:20,503 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:18:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2018-07-23 15:18:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1441. [2018-07-23 15:18:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-07-23 15:18:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2333 transitions. [2018-07-23 15:18:22,116 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2333 transitions. Word has length 23 [2018-07-23 15:18:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:22,116 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 2333 transitions. [2018-07-23 15:18:22,116 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:18:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2333 transitions. [2018-07-23 15:18:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:22,117 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:22,117 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 15:18:22,117 INFO L414 AbstractCegarLoop]: === Iteration 150 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:22,117 INFO L82 PathProgramCache]: Analyzing trace with hash 162203814, now seen corresponding path program 2 times [2018-07-23 15:18:22,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-23 15:18:22,132 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:22,132 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:18:22,133 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:18:22,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:18:22,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:18:22,133 INFO L87 Difference]: Start difference. First operand 1441 states and 2333 transitions. Second operand 15 states. [2018-07-23 15:18:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:24,221 INFO L93 Difference]: Finished difference Result 1620 states and 2601 transitions. [2018-07-23 15:18:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:18:24,221 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-23 15:18:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:24,224 INFO L225 Difference]: With dead ends: 1620 [2018-07-23 15:18:24,224 INFO L226 Difference]: Without dead ends: 1619 [2018-07-23 15:18:24,224 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:18:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-07-23 15:18:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1439. [2018-07-23 15:18:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-07-23 15:18:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2328 transitions. [2018-07-23 15:18:25,879 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2328 transitions. Word has length 23 [2018-07-23 15:18:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:25,880 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2328 transitions. [2018-07-23 15:18:25,880 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:18:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2328 transitions. [2018-07-23 15:18:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:25,880 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:25,880 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:25,881 INFO L414 AbstractCegarLoop]: === Iteration 151 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 162205096, now seen corresponding path program 2 times [2018-07-23 15:18:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:25,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:25,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:18:25,896 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:18:25,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:18:25,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:18:25,896 INFO L87 Difference]: Start difference. First operand 1439 states and 2328 transitions. Second operand 14 states. [2018-07-23 15:18:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:28,000 INFO L93 Difference]: Finished difference Result 1661 states and 2663 transitions. [2018-07-23 15:18:28,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:18:28,000 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-23 15:18:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:28,002 INFO L225 Difference]: With dead ends: 1661 [2018-07-23 15:18:28,002 INFO L226 Difference]: Without dead ends: 1659 [2018-07-23 15:18:28,003 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:18:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-07-23 15:18:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1441. [2018-07-23 15:18:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-07-23 15:18:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2330 transitions. [2018-07-23 15:18:29,608 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2330 transitions. Word has length 23 [2018-07-23 15:18:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:29,608 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 2330 transitions. [2018-07-23 15:18:29,608 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:18:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2330 transitions. [2018-07-23 15:18:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:29,609 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:29,609 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:29,609 INFO L414 AbstractCegarLoop]: === Iteration 152 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash 208964473, now seen corresponding path program 2 times [2018-07-23 15:18:29,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:29,629 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:29,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:18:29,630 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:18:29,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:18:29,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:18:29,630 INFO L87 Difference]: Start difference. First operand 1441 states and 2330 transitions. Second operand 15 states. [2018-07-23 15:18:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:32,325 INFO L93 Difference]: Finished difference Result 2002 states and 3222 transitions. [2018-07-23 15:18:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:18:32,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-23 15:18:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:32,328 INFO L225 Difference]: With dead ends: 2002 [2018-07-23 15:18:32,328 INFO L226 Difference]: Without dead ends: 2000 [2018-07-23 15:18:32,328 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:18:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-07-23 15:18:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1602. [2018-07-23 15:18:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-07-23 15:18:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2591 transitions. [2018-07-23 15:18:34,234 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2591 transitions. Word has length 23 [2018-07-23 15:18:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:34,234 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2591 transitions. [2018-07-23 15:18:34,234 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:18:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2591 transitions. [2018-07-23 15:18:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 15:18:34,235 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:34,235 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:34,236 INFO L414 AbstractCegarLoop]: === Iteration 153 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:34,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1117815128, now seen corresponding path program 1 times [2018-07-23 15:18:34,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:34,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:34,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:18:34,255 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:18:34,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:18:34,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:18:34,255 INFO L87 Difference]: Start difference. First operand 1602 states and 2591 transitions. Second operand 13 states. [2018-07-23 15:18:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:36,872 INFO L93 Difference]: Finished difference Result 1864 states and 2997 transitions. [2018-07-23 15:18:36,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:18:36,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-07-23 15:18:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:36,874 INFO L225 Difference]: With dead ends: 1864 [2018-07-23 15:18:36,874 INFO L226 Difference]: Without dead ends: 1862 [2018-07-23 15:18:36,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:18:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-07-23 15:18:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1671. [2018-07-23 15:18:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-07-23 15:18:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2717 transitions. [2018-07-23 15:18:38,788 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2717 transitions. Word has length 23 [2018-07-23 15:18:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2717 transitions. [2018-07-23 15:18:38,788 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:18:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2717 transitions. [2018-07-23 15:18:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:18:38,789 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:38,789 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 15:18:38,789 INFO L414 AbstractCegarLoop]: === Iteration 154 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash -821177279, now seen corresponding path program 2 times [2018-07-23 15:18:38,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:38,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:38,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:18:38,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:18:38,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:18:38,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:18:38,807 INFO L87 Difference]: Start difference. First operand 1671 states and 2717 transitions. Second operand 16 states. [2018-07-23 15:18:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:41,039 INFO L93 Difference]: Finished difference Result 1740 states and 2811 transitions. [2018-07-23 15:18:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:18:41,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 15:18:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:41,042 INFO L225 Difference]: With dead ends: 1740 [2018-07-23 15:18:41,042 INFO L226 Difference]: Without dead ends: 1739 [2018-07-23 15:18:41,042 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:18:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2018-07-23 15:18:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1613. [2018-07-23 15:18:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2018-07-23 15:18:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2622 transitions. [2018-07-23 15:18:42,968 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2622 transitions. Word has length 25 [2018-07-23 15:18:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:42,968 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2622 transitions. [2018-07-23 15:18:42,968 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:18:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2622 transitions. [2018-07-23 15:18:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:18:42,969 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:42,969 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:42,969 INFO L414 AbstractCegarLoop]: === Iteration 155 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:42,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1822640705, now seen corresponding path program 1 times [2018-07-23 15:18:42,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:42,984 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:42,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:18:42,985 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:18:42,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:18:42,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:18:42,985 INFO L87 Difference]: Start difference. First operand 1613 states and 2622 transitions. Second operand 15 states. [2018-07-23 15:18:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:45,218 INFO L93 Difference]: Finished difference Result 1786 states and 2897 transitions. [2018-07-23 15:18:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:18:45,219 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-07-23 15:18:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:45,221 INFO L225 Difference]: With dead ends: 1786 [2018-07-23 15:18:45,221 INFO L226 Difference]: Without dead ends: 1785 [2018-07-23 15:18:45,221 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:18:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2018-07-23 15:18:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1655. [2018-07-23 15:18:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2018-07-23 15:18:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2692 transitions. [2018-07-23 15:18:47,229 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2692 transitions. Word has length 25 [2018-07-23 15:18:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:47,229 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2692 transitions. [2018-07-23 15:18:47,229 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:18:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2692 transitions. [2018-07-23 15:18:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:18:47,230 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:47,230 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 15:18:47,230 INFO L414 AbstractCegarLoop]: === Iteration 156 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1372501011, now seen corresponding path program 3 times [2018-07-23 15:18:47,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:47,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:47,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:18:47,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:18:47,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:18:47,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:18:47,246 INFO L87 Difference]: Start difference. First operand 1655 states and 2692 transitions. Second operand 16 states. [2018-07-23 15:18:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:50,066 INFO L93 Difference]: Finished difference Result 2034 states and 3278 transitions. [2018-07-23 15:18:50,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 15:18:50,066 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 15:18:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:50,068 INFO L225 Difference]: With dead ends: 2034 [2018-07-23 15:18:50,068 INFO L226 Difference]: Without dead ends: 2033 [2018-07-23 15:18:50,069 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:18:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2018-07-23 15:18:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1671. [2018-07-23 15:18:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-07-23 15:18:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2720 transitions. [2018-07-23 15:18:52,053 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2720 transitions. Word has length 25 [2018-07-23 15:18:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:52,053 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2720 transitions. [2018-07-23 15:18:52,053 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:18:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2720 transitions. [2018-07-23 15:18:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:18:52,054 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:52,055 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:52,055 INFO L414 AbstractCegarLoop]: === Iteration 157 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash -532386214, now seen corresponding path program 6 times [2018-07-23 15:18:52,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:52,085 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:52,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:18:52,085 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:18:52,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:18:52,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:18:52,086 INFO L87 Difference]: Start difference. First operand 1671 states and 2720 transitions. Second operand 18 states. [2018-07-23 15:18:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:54,346 INFO L93 Difference]: Finished difference Result 1747 states and 2831 transitions. [2018-07-23 15:18:54,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:18:54,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-23 15:18:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:54,348 INFO L225 Difference]: With dead ends: 1747 [2018-07-23 15:18:54,348 INFO L226 Difference]: Without dead ends: 1746 [2018-07-23 15:18:54,349 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:18:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-07-23 15:18:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1673. [2018-07-23 15:18:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2018-07-23 15:18:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2721 transitions. [2018-07-23 15:18:56,355 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2721 transitions. Word has length 25 [2018-07-23 15:18:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:18:56,355 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2721 transitions. [2018-07-23 15:18:56,355 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:18:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2721 transitions. [2018-07-23 15:18:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:18:56,356 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:18:56,356 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:18:56,356 INFO L414 AbstractCegarLoop]: === Iteration 158 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:18:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1681122916, now seen corresponding path program 2 times [2018-07-23 15:18:56,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:18:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:18:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:18:56,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:18:56,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:18:56,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:18:56,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:18:56,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:18:56,382 INFO L87 Difference]: Start difference. First operand 1673 states and 2721 transitions. Second operand 17 states. [2018-07-23 15:18:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:18:58,800 INFO L93 Difference]: Finished difference Result 1789 states and 2888 transitions. [2018-07-23 15:18:58,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:18:58,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-23 15:18:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:18:58,801 INFO L225 Difference]: With dead ends: 1789 [2018-07-23 15:18:58,802 INFO L226 Difference]: Without dead ends: 1787 [2018-07-23 15:18:58,802 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:18:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-07-23 15:19:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1641. [2018-07-23 15:19:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2018-07-23 15:19:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2669 transitions. [2018-07-23 15:19:00,794 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2669 transitions. Word has length 25 [2018-07-23 15:19:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:00,795 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2669 transitions. [2018-07-23 15:19:00,795 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:19:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2669 transitions. [2018-07-23 15:19:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:00,796 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:00,796 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-23 15:19:00,796 INFO L414 AbstractCegarLoop]: === Iteration 159 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1832810091, now seen corresponding path program 4 times [2018-07-23 15:19:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:00,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:00,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:19:00,811 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:19:00,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:19:00,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:19:00,812 INFO L87 Difference]: Start difference. First operand 1641 states and 2669 transitions. Second operand 16 states. [2018-07-23 15:19:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:03,379 INFO L93 Difference]: Finished difference Result 1864 states and 3013 transitions. [2018-07-23 15:19:03,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 15:19:03,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 15:19:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:03,381 INFO L225 Difference]: With dead ends: 1864 [2018-07-23 15:19:03,381 INFO L226 Difference]: Without dead ends: 1862 [2018-07-23 15:19:03,382 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:19:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-07-23 15:19:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1610. [2018-07-23 15:19:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-07-23 15:19:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2618 transitions. [2018-07-23 15:19:05,392 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2618 transitions. Word has length 25 [2018-07-23 15:19:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:05,392 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2618 transitions. [2018-07-23 15:19:05,392 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:19:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2618 transitions. [2018-07-23 15:19:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:05,393 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:05,393 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:19:05,393 INFO L414 AbstractCegarLoop]: === Iteration 160 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:05,393 INFO L82 PathProgramCache]: Analyzing trace with hash -72077134, now seen corresponding path program 7 times [2018-07-23 15:19:05,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:05,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:05,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:19:05,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:19:05,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:19:05,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:19:05,422 INFO L87 Difference]: Start difference. First operand 1610 states and 2618 transitions. Second operand 18 states. [2018-07-23 15:19:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:07,867 INFO L93 Difference]: Finished difference Result 1778 states and 2887 transitions. [2018-07-23 15:19:07,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:19:07,868 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-23 15:19:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:07,870 INFO L225 Difference]: With dead ends: 1778 [2018-07-23 15:19:07,870 INFO L226 Difference]: Without dead ends: 1777 [2018-07-23 15:19:07,870 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:19:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-07-23 15:19:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1650. [2018-07-23 15:19:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-07-23 15:19:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2682 transitions. [2018-07-23 15:19:09,918 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2682 transitions. Word has length 25 [2018-07-23 15:19:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:09,919 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2682 transitions. [2018-07-23 15:19:09,919 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:19:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2682 transitions. [2018-07-23 15:19:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:09,920 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:09,920 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:19:09,920 INFO L414 AbstractCegarLoop]: === Iteration 161 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:09,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1741678744, now seen corresponding path program 3 times [2018-07-23 15:19:09,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:09,937 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:09,937 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:19:09,937 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:19:09,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:19:09,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:19:09,937 INFO L87 Difference]: Start difference. First operand 1650 states and 2682 transitions. Second operand 17 states. [2018-07-23 15:19:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:12,285 INFO L93 Difference]: Finished difference Result 1836 states and 2973 transitions. [2018-07-23 15:19:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:19:12,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-23 15:19:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:12,287 INFO L225 Difference]: With dead ends: 1836 [2018-07-23 15:19:12,288 INFO L226 Difference]: Without dead ends: 1835 [2018-07-23 15:19:12,288 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:19:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2018-07-23 15:19:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1762. [2018-07-23 15:19:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2018-07-23 15:19:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2868 transitions. [2018-07-23 15:19:14,460 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2868 transitions. Word has length 25 [2018-07-23 15:19:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:14,460 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2868 transitions. [2018-07-23 15:19:14,460 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:19:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2868 transitions. [2018-07-23 15:19:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:14,461 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:14,461 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:19:14,461 INFO L414 AbstractCegarLoop]: === Iteration 162 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:14,461 INFO L82 PathProgramCache]: Analyzing trace with hash -463321892, now seen corresponding path program 3 times [2018-07-23 15:19:14,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:14,481 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:14,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:19:14,482 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:19:14,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:19:14,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:19:14,482 INFO L87 Difference]: Start difference. First operand 1762 states and 2868 transitions. Second operand 17 states. [2018-07-23 15:19:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:17,581 INFO L93 Difference]: Finished difference Result 2066 states and 3329 transitions. [2018-07-23 15:19:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 15:19:17,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-23 15:19:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:17,585 INFO L225 Difference]: With dead ends: 2066 [2018-07-23 15:19:17,585 INFO L226 Difference]: Without dead ends: 2064 [2018-07-23 15:19:17,585 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:19:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2018-07-23 15:19:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1772. [2018-07-23 15:19:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-07-23 15:19:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2884 transitions. [2018-07-23 15:19:19,791 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2884 transitions. Word has length 25 [2018-07-23 15:19:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:19,791 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2884 transitions. [2018-07-23 15:19:19,791 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:19:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2884 transitions. [2018-07-23 15:19:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:19,792 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:19,792 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:19:19,792 INFO L414 AbstractCegarLoop]: === Iteration 163 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1911500712, now seen corresponding path program 1 times [2018-07-23 15:19:19,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:19,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:19,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:19:19,807 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:19:19,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:19:19,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:19:19,807 INFO L87 Difference]: Start difference. First operand 1772 states and 2884 transitions. Second operand 14 states. [2018-07-23 15:19:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:22,299 INFO L93 Difference]: Finished difference Result 1956 states and 3171 transitions. [2018-07-23 15:19:22,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:19:22,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-23 15:19:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:22,302 INFO L225 Difference]: With dead ends: 1956 [2018-07-23 15:19:22,302 INFO L226 Difference]: Without dead ends: 1955 [2018-07-23 15:19:22,302 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:19:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-07-23 15:19:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1793. [2018-07-23 15:19:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-07-23 15:19:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2918 transitions. [2018-07-23 15:19:24,590 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2918 transitions. Word has length 25 [2018-07-23 15:19:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:24,590 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2918 transitions. [2018-07-23 15:19:24,590 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:19:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2918 transitions. [2018-07-23 15:19:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:24,591 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:24,591 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:19:24,591 INFO L414 AbstractCegarLoop]: === Iteration 164 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1586218584, now seen corresponding path program 1 times [2018-07-23 15:19:24,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:24,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:24,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:19:24,609 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:19:24,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:19:24,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:19:24,609 INFO L87 Difference]: Start difference. First operand 1793 states and 2918 transitions. Second operand 16 states. [2018-07-23 15:19:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:27,049 INFO L93 Difference]: Finished difference Result 1932 states and 3141 transitions. [2018-07-23 15:19:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:19:27,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 15:19:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:27,051 INFO L225 Difference]: With dead ends: 1932 [2018-07-23 15:19:27,051 INFO L226 Difference]: Without dead ends: 1931 [2018-07-23 15:19:27,051 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:19:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2018-07-23 15:19:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1891. [2018-07-23 15:19:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-07-23 15:19:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3080 transitions. [2018-07-23 15:19:29,391 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3080 transitions. Word has length 25 [2018-07-23 15:19:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:29,392 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 3080 transitions. [2018-07-23 15:19:29,392 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:19:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3080 transitions. [2018-07-23 15:19:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:29,393 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:29,393 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:19:29,393 INFO L414 AbstractCegarLoop]: === Iteration 165 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash -209412774, now seen corresponding path program 1 times [2018-07-23 15:19:29,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:29,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:29,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:19:29,414 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:19:29,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:19:29,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:19:29,415 INFO L87 Difference]: Start difference. First operand 1891 states and 3080 transitions. Second operand 14 states. [2018-07-23 15:19:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:32,135 INFO L93 Difference]: Finished difference Result 2086 states and 3386 transitions. [2018-07-23 15:19:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:19:32,135 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-23 15:19:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:32,138 INFO L225 Difference]: With dead ends: 2086 [2018-07-23 15:19:32,138 INFO L226 Difference]: Without dead ends: 2085 [2018-07-23 15:19:32,138 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:19:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2018-07-23 15:19:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1866. [2018-07-23 15:19:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2018-07-23 15:19:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 3042 transitions. [2018-07-23 15:19:34,522 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 3042 transitions. Word has length 25 [2018-07-23 15:19:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:34,522 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 3042 transitions. [2018-07-23 15:19:34,522 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:19:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 3042 transitions. [2018-07-23 15:19:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 15:19:34,523 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:34,523 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 15:19:34,523 INFO L414 AbstractCegarLoop]: === Iteration 166 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1006660774, now seen corresponding path program 1 times [2018-07-23 15:19:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:19:34,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:34,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:19:34,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:19:34,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:19:34,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:19:34,541 INFO L87 Difference]: Start difference. First operand 1866 states and 3042 transitions. Second operand 16 states. [2018-07-23 15:19:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:19:37,126 INFO L93 Difference]: Finished difference Result 1936 states and 3146 transitions. [2018-07-23 15:19:37,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:19:37,126 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-23 15:19:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:19:37,129 INFO L225 Difference]: With dead ends: 1936 [2018-07-23 15:19:37,129 INFO L226 Difference]: Without dead ends: 1935 [2018-07-23 15:19:37,129 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:19:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2018-07-23 15:19:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1796. [2018-07-23 15:19:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-07-23 15:19:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2921 transitions. [2018-07-23 15:19:39,448 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2921 transitions. Word has length 25 [2018-07-23 15:19:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:19:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2921 transitions. [2018-07-23 15:19:39,448 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:19:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2921 transitions. [2018-07-23 15:19:39,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 15:19:39,449 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:19:39,449 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-23 15:19:39,449 INFO L414 AbstractCegarLoop]: === Iteration 167 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]=== [2018-07-23 15:19:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash -624347648, now seen corresponding path program 3 times [2018-07-23 15:19:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:19:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:19:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 15:19:39,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:19:39,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:19:39,470 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:19:39,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:19:39,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:19:39,470 INFO L87 Difference]: Start difference. First operand 1796 states and 2921 transitions. Second operand 14 states. Received shutdown request... [2018-07-23 15:19:39,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:19:39,562 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 15:19:39,568 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 15:19:39,568 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:19:39 BoogieIcfgContainer [2018-07-23 15:19:39,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:19:39,569 INFO L168 Benchmark]: Toolchain (without parser) took 257946.14 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -902.1 MB). Peak memory consumption was 445.8 MB. Max. memory is 7.1 GB. [2018-07-23 15:19:39,571 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:19:39,571 INFO L168 Benchmark]: Boogie Preprocessor took 53.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:19:39,571 INFO L168 Benchmark]: RCFGBuilder took 277.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:19:39,572 INFO L168 Benchmark]: TraceAbstraction took 257610.51 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -912.7 MB). Peak memory consumption was 435.3 MB. Max. memory is 7.1 GB. [2018-07-23 15:19:39,574 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 277.53 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257610.51 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -912.7 MB). Peak memory consumption was 435.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 7 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 7 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 7 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (1796states) and interpolant automaton (currently 7 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 257.5s OverallTime, 167 OverallIterations, 4 TraceHistogramMax, 145.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6229 SDtfs, 16259 SDslu, 15883 SDs, 0 SdLazy, 95102 SolverSat, 6608 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3884 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3734 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22109 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1891occurred in iteration=164, 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: 108.5s AutomataMinimizationTime, 166 MinimizatonAttempts, 15973 StatesRemovedByMinimization, 163 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2883 NumberOfCodeBlocks, 2883 NumberOfCodeBlocksAsserted, 167 NumberOfCheckSat, 2716 ConstructedInterpolants, 0 QuantifiedInterpolants, 299247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 167 InterpolantComputations, 10 PerfectInterpolantSequences, 276/1493 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-19-39-589.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-19-39-589.csv Completed graceful shutdown