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_WithoutIf.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-56c9370
[2018-07-23 15:15:38,248 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-07-23 15:15:38,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-07-23 15:15:38,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-07-23 15:15:38,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-07-23 15:15:38,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-07-23 15:15:38,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-07-23 15:15:38,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-07-23 15:15:38,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-07-23 15:15:38,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-07-23 15:15:38,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-07-23 15:15:38,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-07-23 15:15:38,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-07-23 15:15:38,284 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-07-23 15:15:38,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-07-23 15:15:38,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-07-23 15:15:38,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-07-23 15:15:38,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-07-23 15:15:38,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-07-23 15:15:38,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-07-23 15:15:38,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-07-23 15:15:38,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-07-23 15:15:38,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-07-23 15:15:38,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-07-23 15:15:38,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-07-23 15:15:38,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-07-23 15:15:38,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-07-23 15:15:38,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-07-23 15:15:38,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-07-23 15:15:38,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-07-23 15:15:38,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-07-23 15:15:38,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-07-23 15:15:38,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-07-23 15:15:38,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-07-23 15:15:38,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-07-23 15:15:38,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-07-23 15:15:38,332 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:38,357 INFO L110 SettingsManager]: Loading preferences was successful
[2018-07-23 15:15:38,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-07-23 15:15:38,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-07-23 15:15:38,360 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol
[2018-07-23 15:15:38,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-07-23 15:15:38,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2018-07-23 15:15:38,360 INFO L133 SettingsManager]: * Use separate solver for trace checks=false
[2018-07-23 15:15:38,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-07-23 15:15:38,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-07-23 15:15:38,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-07-23 15:15:38,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-07-23 15:15:38,457 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-07-23 15:15:38,458 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized
[2018-07-23 15:15:38,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl
[2018-07-23 15:15:38,459 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl'
[2018-07-23 15:15:38,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-07-23 15:15:38,535 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements.
[2018-07-23 15:15:38,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-07-23 15:15:38,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-07-23 15:15:38,536 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-07-23 15:15:38,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/1) ...
[2018-07-23 15:15:38,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/1) ...
[2018-07-23 15:15:38,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/1) ...
[2018-07-23 15:15:38,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/1) ...
[2018-07-23 15:15:38,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/1) ...
[2018-07-23 15:15:38,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/1) ...
[2018-07-23 15:15:38,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/1) ...
[2018-07-23 15:15:38,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-07-23 15:15:38,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-07-23 15:15:38,592 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-07-23 15:15:38,592 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-07-23 15:15:38,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/1) ...
[2018-07-23 15:15:38,681 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration
[2018-07-23 15:15:38,681 INFO L130 BoogieDeclarations]: Found specification of procedure product
[2018-07-23 15:15:38,681 INFO L138 BoogieDeclarations]: Found implementation of procedure product
[2018-07-23 15:15:38,843 INFO L258 CfgBuilder]: Using library mode
[2018-07-23 15:15:38,843 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:15:38 BoogieIcfgContainer
[2018-07-23 15:15:38,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-07-23 15:15:38,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-07-23 15:15:38,845 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-07-23 15:15:38,849 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-07-23 15:15:38,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:15:38" (1/2) ...
[2018-07-23 15:15:38,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef6fed5 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:15:38, skipping insertion in model container
[2018-07-23 15:15:38,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:15:38" (2/2) ...
[2018-07-23 15:15:38,853 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl
[2018-07-23 15:15:38,863 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-07-23 15:15:38,870 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations.
[2018-07-23 15:15:38,917 INFO L128 ementStrategyFactory]: Using default assertion order modulation
[2018-07-23 15:15:38,917 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2018-07-23 15:15:38,918 INFO L374 AbstractCegarLoop]: Hoare is true
[2018-07-23 15:15:38,918 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2018-07-23 15:15:38,918 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-07-23 15:15:38,918 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-07-23 15:15:38,918 INFO L378 AbstractCegarLoop]: Difference is false
[2018-07-23 15:15:38,918 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-07-23 15:15:38,919 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-07-23 15:15:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states.
[2018-07-23 15:15:38,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2018-07-23 15:15:38,942 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:38,943 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2018-07-23 15:15:38,943 INFO L414 AbstractCegarLoop]: === Iteration 1 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times
[2018-07-23 15:15:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:39,048 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:39,051 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 15:15:39,051 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-07-23 15:15:39,056 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-07-23 15:15:39,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-07-23 15:15:39,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-07-23 15:15:39,075 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states.
[2018-07-23 15:15:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:39,292 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions.
[2018-07-23 15:15:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-07-23 15:15:39,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4
[2018-07-23 15:15:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:39,308 INFO L225 Difference]: With dead ends: 32
[2018-07-23 15:15:39,308 INFO L226 Difference]: Without dead ends: 30
[2018-07-23 15:15:39,312 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:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2018-07-23 15:15:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24.
[2018-07-23 15:15:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2018-07-23 15:15:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions.
[2018-07-23 15:15:39,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4
[2018-07-23 15:15:39,366 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:39,366 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions.
[2018-07-23 15:15:39,366 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-07-23 15:15:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions.
[2018-07-23 15:15:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2018-07-23 15:15:39,368 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:39,368 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2018-07-23 15:15:39,368 INFO L414 AbstractCegarLoop]: === Iteration 2 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times
[2018-07-23 15:15:39,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:39,410 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:39,410 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 15:15:39,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-07-23 15:15:39,414 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-07-23 15:15:39,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-07-23 15:15:39,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-07-23 15:15:39,415 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states.
[2018-07-23 15:15:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:39,554 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions.
[2018-07-23 15:15:39,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-07-23 15:15:39,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4
[2018-07-23 15:15:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:39,556 INFO L225 Difference]: With dead ends: 38
[2018-07-23 15:15:39,556 INFO L226 Difference]: Without dead ends: 36
[2018-07-23 15:15:39,557 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:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2018-07-23 15:15:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30.
[2018-07-23 15:15:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-07-23 15:15:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions.
[2018-07-23 15:15:39,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4
[2018-07-23 15:15:39,568 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:39,568 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions.
[2018-07-23 15:15:39,568 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-07-23 15:15:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions.
[2018-07-23 15:15:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2018-07-23 15:15:39,569 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:39,569 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2018-07-23 15:15:39,569 INFO L414 AbstractCegarLoop]: === Iteration 3 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times
[2018-07-23 15:15:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:39,607 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:39,607 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 15:15:39,607 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-07-23 15:15:39,608 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-07-23 15:15:39,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-07-23 15:15:39,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-07-23 15:15:39,609 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states.
[2018-07-23 15:15:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:39,771 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions.
[2018-07-23 15:15:39,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:15:39,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5
[2018-07-23 15:15:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:39,773 INFO L225 Difference]: With dead ends: 43
[2018-07-23 15:15:39,773 INFO L226 Difference]: Without dead ends: 41
[2018-07-23 15:15:39,775 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:15:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2018-07-23 15:15:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37.
[2018-07-23 15:15:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2018-07-23 15:15:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions.
[2018-07-23 15:15:39,794 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5
[2018-07-23 15:15:39,794 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:39,794 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions.
[2018-07-23 15:15:39,794 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-07-23 15:15:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions.
[2018-07-23 15:15:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2018-07-23 15:15:39,795 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:39,795 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2018-07-23 15:15:39,796 INFO L414 AbstractCegarLoop]: === Iteration 4 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times
[2018-07-23 15:15:39,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:39,814 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:39,815 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 15:15:39,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-07-23 15:15:39,815 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-07-23 15:15:39,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-07-23 15:15:39,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-07-23 15:15:39,816 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states.
[2018-07-23 15:15:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:39,927 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions.
[2018-07-23 15:15:39,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-07-23 15:15:39,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5
[2018-07-23 15:15:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:39,929 INFO L225 Difference]: With dead ends: 54
[2018-07-23 15:15:39,929 INFO L226 Difference]: Without dead ends: 52
[2018-07-23 15:15:39,930 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-07-23 15:15:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43.
[2018-07-23 15:15:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2018-07-23 15:15:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions.
[2018-07-23 15:15:39,950 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5
[2018-07-23 15:15:39,951 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:39,951 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions.
[2018-07-23 15:15:39,951 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-07-23 15:15:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions.
[2018-07-23 15:15:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:39,952 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:39,953 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:39,953 INFO L414 AbstractCegarLoop]: === Iteration 5 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times
[2018-07-23 15:15:39,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:40,012 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:40,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:40,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:40,013 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:40,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:40,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:40,017 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 8 states.
[2018-07-23 15:15:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:40,241 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions.
[2018-07-23 15:15:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-07-23 15:15:40,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8
[2018-07-23 15:15:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:40,244 INFO L225 Difference]: With dead ends: 79
[2018-07-23 15:15:40,244 INFO L226 Difference]: Without dead ends: 78
[2018-07-23 15:15:40,245 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182
[2018-07-23 15:15:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2018-07-23 15:15:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59.
[2018-07-23 15:15:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-07-23 15:15:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 100 transitions.
[2018-07-23 15:15:40,263 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 100 transitions. Word has length 8
[2018-07-23 15:15:40,263 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:40,264 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 100 transitions.
[2018-07-23 15:15:40,264 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 100 transitions.
[2018-07-23 15:15:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:40,265 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:40,265 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:40,267 INFO L414 AbstractCegarLoop]: === Iteration 6 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:40,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times
[2018-07-23 15:15:40,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:40,300 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:40,300 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 15:15:40,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-07-23 15:15:40,301 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:40,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:40,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:40,302 INFO L87 Difference]: Start difference. First operand 59 states and 100 transitions. Second operand 8 states.
[2018-07-23 15:15:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:40,485 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions.
[2018-07-23 15:15:40,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-07-23 15:15:40,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8
[2018-07-23 15:15:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:40,487 INFO L225 Difference]: With dead ends: 92
[2018-07-23 15:15:40,490 INFO L226 Difference]: Without dead ends: 90
[2018-07-23 15:15:40,491 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272
[2018-07-23 15:15:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2018-07-23 15:15:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72.
[2018-07-23 15:15:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states.
[2018-07-23 15:15:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 125 transitions.
[2018-07-23 15:15:40,525 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 125 transitions. Word has length 8
[2018-07-23 15:15:40,526 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 125 transitions.
[2018-07-23 15:15:40,526 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions.
[2018-07-23 15:15:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:40,530 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:40,530 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:40,530 INFO L414 AbstractCegarLoop]: === Iteration 7 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times
[2018-07-23 15:15:40,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:40,567 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:40,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:40,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:40,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:40,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:40,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:40,569 INFO L87 Difference]: Start difference. First operand 72 states and 125 transitions. Second operand 8 states.
[2018-07-23 15:15:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:40,746 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions.
[2018-07-23 15:15:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:15:40,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8
[2018-07-23 15:15:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:40,748 INFO L225 Difference]: With dead ends: 104
[2018-07-23 15:15:40,749 INFO L226 Difference]: Without dead ends: 103
[2018-07-23 15:15:40,752 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2018-07-23 15:15:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2018-07-23 15:15:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78.
[2018-07-23 15:15:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2018-07-23 15:15:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 135 transitions.
[2018-07-23 15:15:40,782 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 135 transitions. Word has length 8
[2018-07-23 15:15:40,782 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:40,782 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 135 transitions.
[2018-07-23 15:15:40,783 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 135 transitions.
[2018-07-23 15:15:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:40,784 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:40,784 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:40,784 INFO L414 AbstractCegarLoop]: === Iteration 8 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times
[2018-07-23 15:15:40,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:40,805 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:40,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:40,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:40,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:40,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:40,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:40,807 INFO L87 Difference]: Start difference. First operand 78 states and 135 transitions. Second operand 8 states.
[2018-07-23 15:15:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:40,922 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions.
[2018-07-23 15:15:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-07-23 15:15:40,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8
[2018-07-23 15:15:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:40,924 INFO L225 Difference]: With dead ends: 109
[2018-07-23 15:15:40,924 INFO L226 Difference]: Without dead ends: 107
[2018-07-23 15:15:40,925 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:15:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2018-07-23 15:15:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83.
[2018-07-23 15:15:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-07-23 15:15:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 144 transitions.
[2018-07-23 15:15:40,954 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 144 transitions. Word has length 8
[2018-07-23 15:15:40,954 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:40,954 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 144 transitions.
[2018-07-23 15:15:40,955 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 144 transitions.
[2018-07-23 15:15:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:40,959 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:40,959 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:40,959 INFO L414 AbstractCegarLoop]: === Iteration 9 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1965444251, now seen corresponding path program 1 times
[2018-07-23 15:15:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:40,984 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:40,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:40,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-07-23 15:15:40,989 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:40,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:40,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:40,990 INFO L87 Difference]: Start difference. First operand 83 states and 144 transitions. Second operand 7 states.
[2018-07-23 15:15:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:41,111 INFO L93 Difference]: Finished difference Result 103 states and 166 transitions.
[2018-07-23 15:15:41,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:15:41,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2018-07-23 15:15:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:41,113 INFO L225 Difference]: With dead ends: 103
[2018-07-23 15:15:41,113 INFO L226 Difference]: Without dead ends: 101
[2018-07-23 15:15:41,115 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2018-07-23 15:15:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2018-07-23 15:15:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85.
[2018-07-23 15:15:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2018-07-23 15:15:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 147 transitions.
[2018-07-23 15:15:41,149 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 147 transitions. Word has length 8
[2018-07-23 15:15:41,149 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:41,149 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 147 transitions.
[2018-07-23 15:15:41,149 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 147 transitions.
[2018-07-23 15:15:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:41,154 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:41,154 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:41,154 INFO L414 AbstractCegarLoop]: === Iteration 10 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times
[2018-07-23 15:15:41,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:41,186 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:41,187 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:41,187 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:41,188 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:41,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:41,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:41,189 INFO L87 Difference]: Start difference. First operand 85 states and 147 transitions. Second operand 8 states.
[2018-07-23 15:15:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:41,371 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions.
[2018-07-23 15:15:41,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:41,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8
[2018-07-23 15:15:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:41,374 INFO L225 Difference]: With dead ends: 103
[2018-07-23 15:15:41,374 INFO L226 Difference]: Without dead ends: 101
[2018-07-23 15:15:41,375 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380
[2018-07-23 15:15:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2018-07-23 15:15:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87.
[2018-07-23 15:15:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2018-07-23 15:15:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 151 transitions.
[2018-07-23 15:15:41,416 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 151 transitions. Word has length 8
[2018-07-23 15:15:41,416 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:41,417 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 151 transitions.
[2018-07-23 15:15:41,417 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 151 transitions.
[2018-07-23 15:15:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:41,418 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:41,418 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:41,419 INFO L414 AbstractCegarLoop]: === Iteration 11 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times
[2018-07-23 15:15:41,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:41,452 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:41,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:41,453 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:41,453 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:41,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:41,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:41,454 INFO L87 Difference]: Start difference. First operand 87 states and 151 transitions. Second operand 8 states.
[2018-07-23 15:15:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:41,623 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions.
[2018-07-23 15:15:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-07-23 15:15:41,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8
[2018-07-23 15:15:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:41,625 INFO L225 Difference]: With dead ends: 128
[2018-07-23 15:15:41,625 INFO L226 Difference]: Without dead ends: 127
[2018-07-23 15:15:41,625 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2018-07-23 15:15:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2018-07-23 15:15:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100.
[2018-07-23 15:15:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states.
[2018-07-23 15:15:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions.
[2018-07-23 15:15:41,671 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 8
[2018-07-23 15:15:41,671 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:41,671 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions.
[2018-07-23 15:15:41,671 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions.
[2018-07-23 15:15:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:41,673 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:41,673 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:41,673 INFO L414 AbstractCegarLoop]: === Iteration 12 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times
[2018-07-23 15:15:41,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:41,694 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:41,695 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:41,695 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-07-23 15:15:41,696 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:41,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:41,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:41,697 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 7 states.
[2018-07-23 15:15:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:41,857 INFO L93 Difference]: Finished difference Result 136 states and 229 transitions.
[2018-07-23 15:15:41,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:15:41,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2018-07-23 15:15:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:41,859 INFO L225 Difference]: With dead ends: 136
[2018-07-23 15:15:41,859 INFO L226 Difference]: Without dead ends: 134
[2018-07-23 15:15:41,861 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2018-07-23 15:15:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2018-07-23 15:15:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102.
[2018-07-23 15:15:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states.
[2018-07-23 15:15:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 178 transitions.
[2018-07-23 15:15:41,911 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 178 transitions. Word has length 8
[2018-07-23 15:15:41,911 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:41,911 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 178 transitions.
[2018-07-23 15:15:41,911 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 178 transitions.
[2018-07-23 15:15:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:41,912 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:41,912 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:41,913 INFO L414 AbstractCegarLoop]: === Iteration 13 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:41,913 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times
[2018-07-23 15:15:41,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:41,946 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:41,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:41,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:41,947 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:41,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:41,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:41,948 INFO L87 Difference]: Start difference. First operand 102 states and 178 transitions. Second operand 8 states.
[2018-07-23 15:15:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:42,114 INFO L93 Difference]: Finished difference Result 150 states and 251 transitions.
[2018-07-23 15:15:42,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-07-23 15:15:42,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8
[2018-07-23 15:15:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:42,117 INFO L225 Difference]: With dead ends: 150
[2018-07-23 15:15:42,117 INFO L226 Difference]: Without dead ends: 149
[2018-07-23 15:15:42,118 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:15:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2018-07-23 15:15:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121.
[2018-07-23 15:15:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2018-07-23 15:15:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions.
[2018-07-23 15:15:42,167 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 8
[2018-07-23 15:15:42,167 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:42,167 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions.
[2018-07-23 15:15:42,167 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions.
[2018-07-23 15:15:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:42,168 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:42,168 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:42,169 INFO L414 AbstractCegarLoop]: === Iteration 14 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times
[2018-07-23 15:15:42,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:42,184 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:42,184 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 15:15:42,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-07-23 15:15:42,185 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:42,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:42,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:42,186 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 7 states.
[2018-07-23 15:15:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:42,383 INFO L93 Difference]: Finished difference Result 178 states and 308 transitions.
[2018-07-23 15:15:42,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:15:42,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2018-07-23 15:15:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:42,392 INFO L225 Difference]: With dead ends: 178
[2018-07-23 15:15:42,393 INFO L226 Difference]: Without dead ends: 176
[2018-07-23 15:15:42,394 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2018-07-23 15:15:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2018-07-23 15:15:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 132.
[2018-07-23 15:15:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states.
[2018-07-23 15:15:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 233 transitions.
[2018-07-23 15:15:42,451 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 233 transitions. Word has length 8
[2018-07-23 15:15:42,451 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:42,451 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 233 transitions.
[2018-07-23 15:15:42,451 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 233 transitions.
[2018-07-23 15:15:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-07-23 15:15:42,452 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:42,452 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:42,452 INFO L414 AbstractCegarLoop]: === Iteration 15 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times
[2018-07-23 15:15:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:42,467 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:42,468 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:42,468 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-07-23 15:15:42,468 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:42,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:42,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:42,469 INFO L87 Difference]: Start difference. First operand 132 states and 233 transitions. Second operand 7 states.
[2018-07-23 15:15:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:42,668 INFO L93 Difference]: Finished difference Result 235 states and 413 transitions.
[2018-07-23 15:15:42,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:15:42,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8
[2018-07-23 15:15:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:42,671 INFO L225 Difference]: With dead ends: 235
[2018-07-23 15:15:42,671 INFO L226 Difference]: Without dead ends: 233
[2018-07-23 15:15:42,672 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2018-07-23 15:15:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2018-07-23 15:15:42,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 179.
[2018-07-23 15:15:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states.
[2018-07-23 15:15:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 320 transitions.
[2018-07-23 15:15:42,759 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 320 transitions. Word has length 8
[2018-07-23 15:15:42,759 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:42,760 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 320 transitions.
[2018-07-23 15:15:42,760 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 320 transitions.
[2018-07-23 15:15:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-07-23 15:15:42,761 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:42,761 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1]
[2018-07-23 15:15:42,761 INFO L414 AbstractCegarLoop]: === Iteration 16 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:42,761 INFO L82 PathProgramCache]: Analyzing trace with hash -799219888, now seen corresponding path program 1 times
[2018-07-23 15:15:42,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:42,792 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:42,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:42,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:42,793 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:42,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:42,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:42,794 INFO L87 Difference]: Start difference. First operand 179 states and 320 transitions. Second operand 8 states.
[2018-07-23 15:15:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:43,017 INFO L93 Difference]: Finished difference Result 206 states and 368 transitions.
[2018-07-23 15:15:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:43,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9
[2018-07-23 15:15:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:43,019 INFO L225 Difference]: With dead ends: 206
[2018-07-23 15:15:43,019 INFO L226 Difference]: Without dead ends: 204
[2018-07-23 15:15:43,020 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272
[2018-07-23 15:15:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2018-07-23 15:15:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196.
[2018-07-23 15:15:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states.
[2018-07-23 15:15:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 351 transitions.
[2018-07-23 15:15:43,146 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 351 transitions. Word has length 9
[2018-07-23 15:15:43,147 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:43,147 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 351 transitions.
[2018-07-23 15:15:43,147 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 351 transitions.
[2018-07-23 15:15:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-07-23 15:15:43,148 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:43,148 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:43,148 INFO L414 AbstractCegarLoop]: === Iteration 17 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:43,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1170716006, now seen corresponding path program 1 times
[2018-07-23 15:15:43,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:43,173 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:43,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:43,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:43,174 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:43,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:43,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:43,175 INFO L87 Difference]: Start difference. First operand 196 states and 351 transitions. Second operand 9 states.
[2018-07-23 15:15:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:43,485 INFO L93 Difference]: Finished difference Result 266 states and 466 transitions.
[2018-07-23 15:15:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-07-23 15:15:43,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9
[2018-07-23 15:15:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:43,487 INFO L225 Difference]: With dead ends: 266
[2018-07-23 15:15:43,488 INFO L226 Difference]: Without dead ends: 264
[2018-07-23 15:15:43,489 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552
[2018-07-23 15:15:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states.
[2018-07-23 15:15:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 222.
[2018-07-23 15:15:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states.
[2018-07-23 15:15:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 402 transitions.
[2018-07-23 15:15:43,576 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 402 transitions. Word has length 9
[2018-07-23 15:15:43,576 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:43,576 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 402 transitions.
[2018-07-23 15:15:43,577 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 402 transitions.
[2018-07-23 15:15:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:43,577 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:43,578 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:43,578 INFO L414 AbstractCegarLoop]: === Iteration 18 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times
[2018-07-23 15:15:43,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:43,591 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:43,591 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:43,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:43,592 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:43,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:43,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:43,592 INFO L87 Difference]: Start difference. First operand 222 states and 402 transitions. Second operand 7 states.
[2018-07-23 15:15:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:43,773 INFO L93 Difference]: Finished difference Result 264 states and 459 transitions.
[2018-07-23 15:15:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:15:43,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:43,775 INFO L225 Difference]: With dead ends: 264
[2018-07-23 15:15:43,775 INFO L226 Difference]: Without dead ends: 262
[2018-07-23 15:15:43,776 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:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states.
[2018-07-23 15:15:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 231.
[2018-07-23 15:15:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states.
[2018-07-23 15:15:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 420 transitions.
[2018-07-23 15:15:43,863 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 420 transitions. Word has length 11
[2018-07-23 15:15:43,864 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:43,864 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 420 transitions.
[2018-07-23 15:15:43,864 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 420 transitions.
[2018-07-23 15:15:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:43,865 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:43,865 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:43,865 INFO L414 AbstractCegarLoop]: === Iteration 19 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000296, now seen corresponding path program 1 times
[2018-07-23 15:15:43,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:43,883 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:43,883 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:43,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:15:43,884 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:43,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:43,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:43,884 INFO L87 Difference]: Start difference. First operand 231 states and 420 transitions. Second operand 9 states.
[2018-07-23 15:15:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:44,034 INFO L93 Difference]: Finished difference Result 250 states and 439 transitions.
[2018-07-23 15:15:44,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:15:44,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11
[2018-07-23 15:15:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:44,036 INFO L225 Difference]: With dead ends: 250
[2018-07-23 15:15:44,037 INFO L226 Difference]: Without dead ends: 249
[2018-07-23 15:15:44,037 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:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states.
[2018-07-23 15:15:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231.
[2018-07-23 15:15:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states.
[2018-07-23 15:15:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 419 transitions.
[2018-07-23 15:15:44,124 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 419 transitions. Word has length 11
[2018-07-23 15:15:44,124 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:44,124 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 419 transitions.
[2018-07-23 15:15:44,125 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 419 transitions.
[2018-07-23 15:15:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:44,125 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:44,125 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:44,126 INFO L414 AbstractCegarLoop]: === Iteration 20 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times
[2018-07-23 15:15:44,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:44,147 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:44,147 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:44,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:44,148 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:44,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:44,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:44,149 INFO L87 Difference]: Start difference. First operand 231 states and 419 transitions. Second operand 9 states.
[2018-07-23 15:15:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:44,417 INFO L93 Difference]: Finished difference Result 278 states and 490 transitions.
[2018-07-23 15:15:44,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:44,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11
[2018-07-23 15:15:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:44,419 INFO L225 Difference]: With dead ends: 278
[2018-07-23 15:15:44,420 INFO L226 Difference]: Without dead ends: 276
[2018-07-23 15:15:44,420 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420
[2018-07-23 15:15:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states.
[2018-07-23 15:15:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 242.
[2018-07-23 15:15:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states.
[2018-07-23 15:15:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 439 transitions.
[2018-07-23 15:15:44,517 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 439 transitions. Word has length 11
[2018-07-23 15:15:44,517 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:44,517 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 439 transitions.
[2018-07-23 15:15:44,517 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 439 transitions.
[2018-07-23 15:15:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:44,518 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:44,518 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:44,519 INFO L414 AbstractCegarLoop]: === Iteration 21 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:44,519 INFO L82 PathProgramCache]: Analyzing trace with hash 707062982, now seen corresponding path program 2 times
[2018-07-23 15:15:44,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:44,530 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:44,530 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:44,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:44,531 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:44,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:44,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:44,532 INFO L87 Difference]: Start difference. First operand 242 states and 439 transitions. Second operand 7 states.
[2018-07-23 15:15:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:44,712 INFO L93 Difference]: Finished difference Result 300 states and 527 transitions.
[2018-07-23 15:15:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-07-23 15:15:44,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:44,714 INFO L225 Difference]: With dead ends: 300
[2018-07-23 15:15:44,714 INFO L226 Difference]: Without dead ends: 298
[2018-07-23 15:15:44,715 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:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states.
[2018-07-23 15:15:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 267.
[2018-07-23 15:15:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states.
[2018-07-23 15:15:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 484 transitions.
[2018-07-23 15:15:44,820 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 484 transitions. Word has length 11
[2018-07-23 15:15:44,820 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:44,820 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 484 transitions.
[2018-07-23 15:15:44,820 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 484 transitions.
[2018-07-23 15:15:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:44,821 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:44,821 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:44,821 INFO L414 AbstractCegarLoop]: === Iteration 22 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 707063270, now seen corresponding path program 2 times
[2018-07-23 15:15:44,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:44,840 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:44,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:44,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:15:44,841 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:44,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:44,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:44,841 INFO L87 Difference]: Start difference. First operand 267 states and 484 transitions. Second operand 9 states.
[2018-07-23 15:15:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:45,083 INFO L93 Difference]: Finished difference Result 334 states and 589 transitions.
[2018-07-23 15:15:45,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:15:45,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11
[2018-07-23 15:15:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:45,086 INFO L225 Difference]: With dead ends: 334
[2018-07-23 15:15:45,086 INFO L226 Difference]: Without dead ends: 333
[2018-07-23 15:15:45,087 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:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states.
[2018-07-23 15:15:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 282.
[2018-07-23 15:15:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states.
[2018-07-23 15:15:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 512 transitions.
[2018-07-23 15:15:45,193 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 512 transitions. Word has length 11
[2018-07-23 15:15:45,193 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:45,193 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 512 transitions.
[2018-07-23 15:15:45,194 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 512 transitions.
[2018-07-23 15:15:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:45,194 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:45,195 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:45,195 INFO L414 AbstractCegarLoop]: === Iteration 23 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:45,195 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times
[2018-07-23 15:15:45,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:45,213 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:45,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:45,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:45,214 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:45,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:45,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:45,214 INFO L87 Difference]: Start difference. First operand 282 states and 512 transitions. Second operand 8 states.
[2018-07-23 15:15:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:45,523 INFO L93 Difference]: Finished difference Result 342 states and 604 transitions.
[2018-07-23 15:15:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-07-23 15:15:45,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11
[2018-07-23 15:15:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:45,526 INFO L225 Difference]: With dead ends: 342
[2018-07-23 15:15:45,526 INFO L226 Difference]: Without dead ends: 340
[2018-07-23 15:15:45,527 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342
[2018-07-23 15:15:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states.
[2018-07-23 15:15:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286.
[2018-07-23 15:15:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states.
[2018-07-23 15:15:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 518 transitions.
[2018-07-23 15:15:45,663 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 518 transitions. Word has length 11
[2018-07-23 15:15:45,663 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:45,663 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 518 transitions.
[2018-07-23 15:15:45,663 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 518 transitions.
[2018-07-23 15:15:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:45,664 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:45,664 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:45,665 INFO L414 AbstractCegarLoop]: === Iteration 24 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 285598401, now seen corresponding path program 1 times
[2018-07-23 15:15:45,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:45,689 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:45,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:45,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:45,690 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:45,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:45,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:45,691 INFO L87 Difference]: Start difference. First operand 286 states and 518 transitions. Second operand 9 states.
[2018-07-23 15:15:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:46,038 INFO L93 Difference]: Finished difference Result 300 states and 532 transitions.
[2018-07-23 15:15:46,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:46,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11
[2018-07-23 15:15:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:46,042 INFO L225 Difference]: With dead ends: 300
[2018-07-23 15:15:46,042 INFO L226 Difference]: Without dead ends: 298
[2018-07-23 15:15:46,043 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420
[2018-07-23 15:15:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states.
[2018-07-23 15:15:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 251.
[2018-07-23 15:15:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states.
[2018-07-23 15:15:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 450 transitions.
[2018-07-23 15:15:46,152 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 450 transitions. Word has length 11
[2018-07-23 15:15:46,152 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:46,153 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 450 transitions.
[2018-07-23 15:15:46,153 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 450 transitions.
[2018-07-23 15:15:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:46,154 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:46,154 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:46,154 INFO L414 AbstractCegarLoop]: === Iteration 25 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:46,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times
[2018-07-23 15:15:46,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:46,184 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:46,184 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 15:15:46,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-07-23 15:15:46,185 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:46,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:46,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:46,186 INFO L87 Difference]: Start difference. First operand 251 states and 450 transitions. Second operand 8 states.
[2018-07-23 15:15:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:46,402 INFO L93 Difference]: Finished difference Result 286 states and 493 transitions.
[2018-07-23 15:15:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:15:46,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11
[2018-07-23 15:15:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:46,405 INFO L225 Difference]: With dead ends: 286
[2018-07-23 15:15:46,405 INFO L226 Difference]: Without dead ends: 284
[2018-07-23 15:15:46,406 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210
[2018-07-23 15:15:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states.
[2018-07-23 15:15:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 257.
[2018-07-23 15:15:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states.
[2018-07-23 15:15:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 460 transitions.
[2018-07-23 15:15:46,522 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 460 transitions. Word has length 11
[2018-07-23 15:15:46,522 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:46,522 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 460 transitions.
[2018-07-23 15:15:46,522 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 460 transitions.
[2018-07-23 15:15:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:46,523 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:46,523 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:46,523 INFO L414 AbstractCegarLoop]: === Iteration 26 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:46,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times
[2018-07-23 15:15:46,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:46,538 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:46,538 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:46,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:46,543 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:46,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:46,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:46,543 INFO L87 Difference]: Start difference. First operand 257 states and 460 transitions. Second operand 7 states.
[2018-07-23 15:15:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:46,736 INFO L93 Difference]: Finished difference Result 292 states and 503 transitions.
[2018-07-23 15:15:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-07-23 15:15:46,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:46,738 INFO L225 Difference]: With dead ends: 292
[2018-07-23 15:15:46,738 INFO L226 Difference]: Without dead ends: 290
[2018-07-23 15:15:46,739 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:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2018-07-23 15:15:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 256.
[2018-07-23 15:15:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-07-23 15:15:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 458 transitions.
[2018-07-23 15:15:46,844 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 458 transitions. Word has length 11
[2018-07-23 15:15:46,845 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:46,845 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 458 transitions.
[2018-07-23 15:15:46,845 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 458 transitions.
[2018-07-23 15:15:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:46,846 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:46,846 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:46,846 INFO L414 AbstractCegarLoop]: === Iteration 27 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:46,846 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times
[2018-07-23 15:15:46,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:46,862 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:46,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:46,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:46,863 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:46,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:46,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:46,864 INFO L87 Difference]: Start difference. First operand 256 states and 458 transitions. Second operand 7 states.
[2018-07-23 15:15:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:47,121 INFO L93 Difference]: Finished difference Result 320 states and 559 transitions.
[2018-07-23 15:15:47,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-07-23 15:15:47,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:47,126 INFO L225 Difference]: With dead ends: 320
[2018-07-23 15:15:47,126 INFO L226 Difference]: Without dead ends: 318
[2018-07-23 15:15:47,127 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2018-07-23 15:15:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2018-07-23 15:15:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281.
[2018-07-23 15:15:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-07-23 15:15:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 503 transitions.
[2018-07-23 15:15:47,251 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 503 transitions. Word has length 11
[2018-07-23 15:15:47,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:47,251 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 503 transitions.
[2018-07-23 15:15:47,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 503 transitions.
[2018-07-23 15:15:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:47,252 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:47,252 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:47,252 INFO L414 AbstractCegarLoop]: === Iteration 28 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times
[2018-07-23 15:15:47,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:47,263 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:47,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:47,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:47,264 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:47,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:47,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:47,265 INFO L87 Difference]: Start difference. First operand 281 states and 503 transitions. Second operand 7 states.
[2018-07-23 15:15:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:47,502 INFO L93 Difference]: Finished difference Result 333 states and 581 transitions.
[2018-07-23 15:15:47,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:15:47,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:47,505 INFO L225 Difference]: With dead ends: 333
[2018-07-23 15:15:47,505 INFO L226 Difference]: Without dead ends: 331
[2018-07-23 15:15:47,506 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182
[2018-07-23 15:15:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states.
[2018-07-23 15:15:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 285.
[2018-07-23 15:15:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states.
[2018-07-23 15:15:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 510 transitions.
[2018-07-23 15:15:47,639 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 510 transitions. Word has length 11
[2018-07-23 15:15:47,639 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:47,640 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 510 transitions.
[2018-07-23 15:15:47,640 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 510 transitions.
[2018-07-23 15:15:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:47,641 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:47,641 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:47,641 INFO L414 AbstractCegarLoop]: === Iteration 29 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times
[2018-07-23 15:15:47,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:47,658 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:47,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:47,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:47,659 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:47,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:47,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:47,660 INFO L87 Difference]: Start difference. First operand 285 states and 510 transitions. Second operand 7 states.
[2018-07-23 15:15:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:47,947 INFO L93 Difference]: Finished difference Result 353 states and 620 transitions.
[2018-07-23 15:15:47,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-07-23 15:15:47,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:47,950 INFO L225 Difference]: With dead ends: 353
[2018-07-23 15:15:47,950 INFO L226 Difference]: Without dead ends: 351
[2018-07-23 15:15:47,953 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240
[2018-07-23 15:15:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states.
[2018-07-23 15:15:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 306.
[2018-07-23 15:15:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states.
[2018-07-23 15:15:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 547 transitions.
[2018-07-23 15:15:48,077 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 547 transitions. Word has length 11
[2018-07-23 15:15:48,077 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:48,077 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 547 transitions.
[2018-07-23 15:15:48,077 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 547 transitions.
[2018-07-23 15:15:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:48,078 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:48,079 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:48,079 INFO L414 AbstractCegarLoop]: === Iteration 30 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times
[2018-07-23 15:15:48,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:48,092 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:48,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:48,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:48,093 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:48,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:48,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:48,094 INFO L87 Difference]: Start difference. First operand 306 states and 547 transitions. Second operand 7 states.
[2018-07-23 15:15:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:48,320 INFO L93 Difference]: Finished difference Result 331 states and 575 transitions.
[2018-07-23 15:15:48,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-07-23 15:15:48,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:48,323 INFO L225 Difference]: With dead ends: 331
[2018-07-23 15:15:48,323 INFO L226 Difference]: Without dead ends: 329
[2018-07-23 15:15:48,324 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:15:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states.
[2018-07-23 15:15:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 300.
[2018-07-23 15:15:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states.
[2018-07-23 15:15:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 534 transitions.
[2018-07-23 15:15:48,484 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 534 transitions. Word has length 11
[2018-07-23 15:15:48,484 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:48,485 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 534 transitions.
[2018-07-23 15:15:48,485 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 534 transitions.
[2018-07-23 15:15:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:48,486 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:48,486 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:48,487 INFO L414 AbstractCegarLoop]: === Iteration 31 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times
[2018-07-23 15:15:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:48,500 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:48,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:48,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:48,501 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:48,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:48,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:48,501 INFO L87 Difference]: Start difference. First operand 300 states and 534 transitions. Second operand 7 states.
[2018-07-23 15:15:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:48,789 INFO L93 Difference]: Finished difference Result 354 states and 618 transitions.
[2018-07-23 15:15:48,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-07-23 15:15:48,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:48,792 INFO L225 Difference]: With dead ends: 354
[2018-07-23 15:15:48,792 INFO L226 Difference]: Without dead ends: 352
[2018-07-23 15:15:48,793 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:15:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states.
[2018-07-23 15:15:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286.
[2018-07-23 15:15:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states.
[2018-07-23 15:15:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 510 transitions.
[2018-07-23 15:15:48,956 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 510 transitions. Word has length 11
[2018-07-23 15:15:48,956 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:48,956 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 510 transitions.
[2018-07-23 15:15:48,957 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 510 transitions.
[2018-07-23 15:15:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-07-23 15:15:48,957 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:48,957 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:48,958 INFO L414 AbstractCegarLoop]: === Iteration 32 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times
[2018-07-23 15:15:48,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:48,972 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:48,973 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:48,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-07-23 15:15:48,973 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:48,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:48,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:48,974 INFO L87 Difference]: Start difference. First operand 286 states and 510 transitions. Second operand 7 states.
[2018-07-23 15:15:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:49,203 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions.
[2018-07-23 15:15:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:15:49,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11
[2018-07-23 15:15:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:49,206 INFO L225 Difference]: With dead ends: 344
[2018-07-23 15:15:49,206 INFO L226 Difference]: Without dead ends: 342
[2018-07-23 15:15:49,207 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:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states.
[2018-07-23 15:15:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 279.
[2018-07-23 15:15:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states.
[2018-07-23 15:15:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 496 transitions.
[2018-07-23 15:15:49,325 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 496 transitions. Word has length 11
[2018-07-23 15:15:49,325 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:49,325 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 496 transitions.
[2018-07-23 15:15:49,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 496 transitions.
[2018-07-23 15:15:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-07-23 15:15:49,326 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:49,326 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:49,327 INFO L414 AbstractCegarLoop]: === Iteration 33 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:49,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1894600283, now seen corresponding path program 1 times
[2018-07-23 15:15:49,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:15:49,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:49,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:49,350 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:49,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:49,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:49,350 INFO L87 Difference]: Start difference. First operand 279 states and 496 transitions. Second operand 7 states.
[2018-07-23 15:15:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:49,603 INFO L93 Difference]: Finished difference Result 634 states and 1102 transitions.
[2018-07-23 15:15:49,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-07-23 15:15:49,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12
[2018-07-23 15:15:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:49,606 INFO L225 Difference]: With dead ends: 634
[2018-07-23 15:15:49,606 INFO L226 Difference]: Without dead ends: 356
[2018-07-23 15:15:49,609 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:15:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states.
[2018-07-23 15:15:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 339.
[2018-07-23 15:15:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states.
[2018-07-23 15:15:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 589 transitions.
[2018-07-23 15:15:49,761 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 589 transitions. Word has length 12
[2018-07-23 15:15:49,761 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:49,762 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 589 transitions.
[2018-07-23 15:15:49,762 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 589 transitions.
[2018-07-23 15:15:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-07-23 15:15:49,762 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:49,763 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:49,763 INFO L414 AbstractCegarLoop]: === Iteration 34 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1217022044, now seen corresponding path program 1 times
[2018-07-23 15:15:49,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:49,787 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:49,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:49,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:49,788 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:49,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:49,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:49,789 INFO L87 Difference]: Start difference. First operand 339 states and 589 transitions. Second operand 9 states.
[2018-07-23 15:15:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:50,096 INFO L93 Difference]: Finished difference Result 433 states and 739 transitions.
[2018-07-23 15:15:50,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-07-23 15:15:50,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-07-23 15:15:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:50,098 INFO L225 Difference]: With dead ends: 433
[2018-07-23 15:15:50,099 INFO L226 Difference]: Without dead ends: 431
[2018-07-23 15:15:50,099 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462
[2018-07-23 15:15:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states.
[2018-07-23 15:15:50,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 396.
[2018-07-23 15:15:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states.
[2018-07-23 15:15:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 693 transitions.
[2018-07-23 15:15:50,274 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 693 transitions. Word has length 12
[2018-07-23 15:15:50,275 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:50,275 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 693 transitions.
[2018-07-23 15:15:50,275 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 693 transitions.
[2018-07-23 15:15:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-07-23 15:15:50,276 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:50,276 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:50,276 INFO L414 AbstractCegarLoop]: === Iteration 35 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1730496441, now seen corresponding path program 2 times
[2018-07-23 15:15:50,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:50,292 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:50,292 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:50,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:50,293 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:15:50,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:15:50,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:15:50,294 INFO L87 Difference]: Start difference. First operand 396 states and 693 transitions. Second operand 7 states.
[2018-07-23 15:15:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:50,616 INFO L93 Difference]: Finished difference Result 897 states and 1547 transitions.
[2018-07-23 15:15:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-07-23 15:15:50,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12
[2018-07-23 15:15:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:50,619 INFO L225 Difference]: With dead ends: 897
[2018-07-23 15:15:50,619 INFO L226 Difference]: Without dead ends: 502
[2018-07-23 15:15:50,621 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:15:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states.
[2018-07-23 15:15:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 435.
[2018-07-23 15:15:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states.
[2018-07-23 15:15:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 751 transitions.
[2018-07-23 15:15:50,807 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 751 transitions. Word has length 12
[2018-07-23 15:15:50,807 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:50,807 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 751 transitions.
[2018-07-23 15:15:50,807 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:15:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 751 transitions.
[2018-07-23 15:15:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-07-23 15:15:50,808 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:50,808 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:50,808 INFO L414 AbstractCegarLoop]: === Iteration 36 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:50,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times
[2018-07-23 15:15:50,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:50,825 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:50,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:50,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:50,826 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:50,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:50,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:50,827 INFO L87 Difference]: Start difference. First operand 435 states and 751 transitions. Second operand 9 states.
[2018-07-23 15:15:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:51,156 INFO L93 Difference]: Finished difference Result 481 states and 818 transitions.
[2018-07-23 15:15:51,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:15:51,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-07-23 15:15:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:51,159 INFO L225 Difference]: With dead ends: 481
[2018-07-23 15:15:51,160 INFO L226 Difference]: Without dead ends: 479
[2018-07-23 15:15:51,160 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342
[2018-07-23 15:15:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states.
[2018-07-23 15:15:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 444.
[2018-07-23 15:15:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states.
[2018-07-23 15:15:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 764 transitions.
[2018-07-23 15:15:51,360 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 764 transitions. Word has length 12
[2018-07-23 15:15:51,360 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:51,360 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 764 transitions.
[2018-07-23 15:15:51,360 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 764 transitions.
[2018-07-23 15:15:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-07-23 15:15:51,361 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:51,361 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:51,361 INFO L414 AbstractCegarLoop]: === Iteration 37 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times
[2018-07-23 15:15:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:51,380 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:51,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:51,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:15:51,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:51,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:51,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:51,381 INFO L87 Difference]: Start difference. First operand 444 states and 764 transitions. Second operand 9 states.
[2018-07-23 15:15:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:51,816 INFO L93 Difference]: Finished difference Result 515 states and 880 transitions.
[2018-07-23 15:15:51,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:51,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-07-23 15:15:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:51,819 INFO L225 Difference]: With dead ends: 515
[2018-07-23 15:15:51,819 INFO L226 Difference]: Without dead ends: 513
[2018-07-23 15:15:51,820 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272
[2018-07-23 15:15:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states.
[2018-07-23 15:15:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 468.
[2018-07-23 15:15:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states.
[2018-07-23 15:15:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 808 transitions.
[2018-07-23 15:15:52,090 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 808 transitions. Word has length 12
[2018-07-23 15:15:52,090 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:52,090 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 808 transitions.
[2018-07-23 15:15:52,090 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 808 transitions.
[2018-07-23 15:15:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-07-23 15:15:52,091 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:52,091 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:52,093 INFO L414 AbstractCegarLoop]: === Iteration 38 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash -317442274, now seen corresponding path program 1 times
[2018-07-23 15:15:52,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:52,122 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:52,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:52,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:52,123 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:52,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:52,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:52,124 INFO L87 Difference]: Start difference. First operand 468 states and 808 transitions. Second operand 9 states.
[2018-07-23 15:15:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:52,577 INFO L93 Difference]: Finished difference Result 550 states and 930 transitions.
[2018-07-23 15:15:52,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-07-23 15:15:52,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13
[2018-07-23 15:15:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:52,581 INFO L225 Difference]: With dead ends: 550
[2018-07-23 15:15:52,581 INFO L226 Difference]: Without dead ends: 548
[2018-07-23 15:15:52,582 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812
[2018-07-23 15:15:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states.
[2018-07-23 15:15:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 483.
[2018-07-23 15:15:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states.
[2018-07-23 15:15:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 836 transitions.
[2018-07-23 15:15:52,809 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 836 transitions. Word has length 13
[2018-07-23 15:15:52,809 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:52,809 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 836 transitions.
[2018-07-23 15:15:52,809 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 836 transitions.
[2018-07-23 15:15:52,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-07-23 15:15:52,810 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:52,810 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:52,810 INFO L414 AbstractCegarLoop]: === Iteration 39 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times
[2018-07-23 15:15:52,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:52,823 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:52,823 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:52,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:52,824 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:52,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:52,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:52,824 INFO L87 Difference]: Start difference. First operand 483 states and 836 transitions. Second operand 8 states.
[2018-07-23 15:15:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:53,153 INFO L93 Difference]: Finished difference Result 528 states and 903 transitions.
[2018-07-23 15:15:53,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-07-23 15:15:53,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14
[2018-07-23 15:15:53,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:53,157 INFO L225 Difference]: With dead ends: 528
[2018-07-23 15:15:53,157 INFO L226 Difference]: Without dead ends: 526
[2018-07-23 15:15:53,158 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:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states.
[2018-07-23 15:15:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 487.
[2018-07-23 15:15:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states.
[2018-07-23 15:15:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions.
[2018-07-23 15:15:53,414 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14
[2018-07-23 15:15:53,415 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:53,415 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions.
[2018-07-23 15:15:53,415 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions.
[2018-07-23 15:15:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-07-23 15:15:53,416 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:53,416 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:53,416 INFO L414 AbstractCegarLoop]: === Iteration 40 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times
[2018-07-23 15:15:53,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:53,433 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:53,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:53,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:53,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:53,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:53,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:53,434 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states.
[2018-07-23 15:15:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:53,838 INFO L93 Difference]: Finished difference Result 562 states and 960 transitions.
[2018-07-23 15:15:53,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:53,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14
[2018-07-23 15:15:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:53,842 INFO L225 Difference]: With dead ends: 562
[2018-07-23 15:15:53,843 INFO L226 Difference]: Without dead ends: 560
[2018-07-23 15:15:53,843 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:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states.
[2018-07-23 15:15:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 487.
[2018-07-23 15:15:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states.
[2018-07-23 15:15:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 842 transitions.
[2018-07-23 15:15:54,080 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 842 transitions. Word has length 14
[2018-07-23 15:15:54,080 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:54,080 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 842 transitions.
[2018-07-23 15:15:54,081 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 842 transitions.
[2018-07-23 15:15:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-07-23 15:15:54,081 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:54,082 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:54,082 INFO L414 AbstractCegarLoop]: === Iteration 41 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1602335980, now seen corresponding path program 3 times
[2018-07-23 15:15:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:54,093 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:54,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:54,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:54,094 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:54,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:54,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:54,094 INFO L87 Difference]: Start difference. First operand 487 states and 842 transitions. Second operand 8 states.
[2018-07-23 15:15:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:54,446 INFO L93 Difference]: Finished difference Result 554 states and 945 transitions.
[2018-07-23 15:15:54,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:54,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14
[2018-07-23 15:15:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:54,450 INFO L225 Difference]: With dead ends: 554
[2018-07-23 15:15:54,450 INFO L226 Difference]: Without dead ends: 552
[2018-07-23 15:15:54,451 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:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states.
[2018-07-23 15:15:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 481.
[2018-07-23 15:15:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states.
[2018-07-23 15:15:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 832 transitions.
[2018-07-23 15:15:54,703 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 832 transitions. Word has length 14
[2018-07-23 15:15:54,703 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:54,703 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 832 transitions.
[2018-07-23 15:15:54,703 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 832 transitions.
[2018-07-23 15:15:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-07-23 15:15:54,704 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:54,704 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:54,705 INFO L414 AbstractCegarLoop]: === Iteration 42 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:54,705 INFO L82 PathProgramCache]: Analyzing trace with hash -245567750, now seen corresponding path program 4 times
[2018-07-23 15:15:54,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:54,719 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:54,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:54,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:54,720 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:54,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:54,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:54,721 INFO L87 Difference]: Start difference. First operand 481 states and 832 transitions. Second operand 8 states.
[2018-07-23 15:15:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:55,114 INFO L93 Difference]: Finished difference Result 547 states and 937 transitions.
[2018-07-23 15:15:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:55,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14
[2018-07-23 15:15:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:55,117 INFO L225 Difference]: With dead ends: 547
[2018-07-23 15:15:55,117 INFO L226 Difference]: Without dead ends: 545
[2018-07-23 15:15:55,118 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:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states.
[2018-07-23 15:15:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 488.
[2018-07-23 15:15:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states.
[2018-07-23 15:15:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 844 transitions.
[2018-07-23 15:15:55,368 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 844 transitions. Word has length 14
[2018-07-23 15:15:55,369 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:55,369 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 844 transitions.
[2018-07-23 15:15:55,369 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 844 transitions.
[2018-07-23 15:15:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-07-23 15:15:55,370 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:55,370 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:55,370 INFO L414 AbstractCegarLoop]: === Iteration 43 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times
[2018-07-23 15:15:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:55,384 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:55,384 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:55,384 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:15:55,385 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:55,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:55,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:55,385 INFO L87 Difference]: Start difference. First operand 488 states and 844 transitions. Second operand 9 states.
[2018-07-23 15:15:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:55,735 INFO L93 Difference]: Finished difference Result 545 states and 922 transitions.
[2018-07-23 15:15:55,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-07-23 15:15:55,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14
[2018-07-23 15:15:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:55,739 INFO L225 Difference]: With dead ends: 545
[2018-07-23 15:15:55,739 INFO L226 Difference]: Without dead ends: 543
[2018-07-23 15:15:55,740 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2018-07-23 15:15:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states.
[2018-07-23 15:15:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 473.
[2018-07-23 15:15:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states.
[2018-07-23 15:15:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 820 transitions.
[2018-07-23 15:15:55,950 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 820 transitions. Word has length 14
[2018-07-23 15:15:55,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:55,951 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 820 transitions.
[2018-07-23 15:15:55,951 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 820 transitions.
[2018-07-23 15:15:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-07-23 15:15:55,952 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:55,952 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:55,952 INFO L414 AbstractCegarLoop]: === Iteration 44 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times
[2018-07-23 15:15:55,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:55,963 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:55,963 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:55,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:15:55,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:55,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:55,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:55,964 INFO L87 Difference]: Start difference. First operand 473 states and 820 transitions. Second operand 8 states.
[2018-07-23 15:15:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:56,322 INFO L93 Difference]: Finished difference Result 535 states and 908 transitions.
[2018-07-23 15:15:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:15:56,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14
[2018-07-23 15:15:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:56,325 INFO L225 Difference]: With dead ends: 535
[2018-07-23 15:15:56,325 INFO L226 Difference]: Without dead ends: 533
[2018-07-23 15:15:56,326 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:15:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states.
[2018-07-23 15:15:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 469.
[2018-07-23 15:15:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states.
[2018-07-23 15:15:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 814 transitions.
[2018-07-23 15:15:56,518 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 814 transitions. Word has length 14
[2018-07-23 15:15:56,518 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:56,518 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 814 transitions.
[2018-07-23 15:15:56,518 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 814 transitions.
[2018-07-23 15:15:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:15:56,519 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:56,519 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:56,519 INFO L414 AbstractCegarLoop]: === Iteration 45 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:56,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1810259450, now seen corresponding path program 1 times
[2018-07-23 15:15:56,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:15:56,533 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:56,533 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-07-23 15:15:56,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-07-23 15:15:56,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-07-23 15:15:56,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-07-23 15:15:56,534 INFO L87 Difference]: Start difference. First operand 469 states and 814 transitions. Second operand 9 states.
[2018-07-23 15:15:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:57,058 INFO L93 Difference]: Finished difference Result 1268 states and 2153 transitions.
[2018-07-23 15:15:57,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-07-23 15:15:57,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15
[2018-07-23 15:15:57,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:57,062 INFO L225 Difference]: With dead ends: 1268
[2018-07-23 15:15:57,063 INFO L226 Difference]: Without dead ends: 764
[2018-07-23 15:15:57,064 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552
[2018-07-23 15:15:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states.
[2018-07-23 15:15:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 651.
[2018-07-23 15:15:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states.
[2018-07-23 15:15:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1121 transitions.
[2018-07-23 15:15:57,317 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1121 transitions. Word has length 15
[2018-07-23 15:15:57,318 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:57,318 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1121 transitions.
[2018-07-23 15:15:57,318 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-07-23 15:15:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1121 transitions.
[2018-07-23 15:15:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:15:57,319 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:57,319 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:57,319 INFO L414 AbstractCegarLoop]: === Iteration 46 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 765271427, now seen corresponding path program 1 times
[2018-07-23 15:15:57,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-07-23 15:15:57,331 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:57,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:15:57,332 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:15:57,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:15:57,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:15:57,333 INFO L87 Difference]: Start difference. First operand 651 states and 1121 transitions. Second operand 8 states.
[2018-07-23 15:15:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:57,959 INFO L93 Difference]: Finished difference Result 1561 states and 2653 transitions.
[2018-07-23 15:15:57,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:15:57,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15
[2018-07-23 15:15:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:57,964 INFO L225 Difference]: With dead ends: 1561
[2018-07-23 15:15:57,965 INFO L226 Difference]: Without dead ends: 911
[2018-07-23 15:15:57,967 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240
[2018-07-23 15:15:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states.
[2018-07-23 15:15:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 651.
[2018-07-23 15:15:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states.
[2018-07-23 15:15:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1114 transitions.
[2018-07-23 15:15:58,313 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1114 transitions. Word has length 15
[2018-07-23 15:15:58,313 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:58,313 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1114 transitions.
[2018-07-23 15:15:58,313 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:15:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1114 transitions.
[2018-07-23 15:15:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:15:58,314 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:58,314 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:58,314 INFO L414 AbstractCegarLoop]: === Iteration 47 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:58,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1161913671, now seen corresponding path program 1 times
[2018-07-23 15:15:58,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:58,357 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:58,357 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:58,358 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-07-23 15:15:58,358 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:15:58,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:15:58,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:15:58,359 INFO L87 Difference]: Start difference. First operand 651 states and 1114 transitions. Second operand 10 states.
[2018-07-23 15:15:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:58,878 INFO L93 Difference]: Finished difference Result 756 states and 1259 transitions.
[2018-07-23 15:15:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-07-23 15:15:58,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:15:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:58,882 INFO L225 Difference]: With dead ends: 756
[2018-07-23 15:15:58,882 INFO L226 Difference]: Without dead ends: 754
[2018-07-23 15:15:58,883 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380
[2018-07-23 15:15:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states.
[2018-07-23 15:15:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 687.
[2018-07-23 15:15:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states.
[2018-07-23 15:15:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1172 transitions.
[2018-07-23 15:15:59,145 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1172 transitions. Word has length 15
[2018-07-23 15:15:59,146 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:15:59,146 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1172 transitions.
[2018-07-23 15:15:59,146 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:15:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1172 transitions.
[2018-07-23 15:15:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:15:59,147 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:15:59,147 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:15:59,147 INFO L414 AbstractCegarLoop]: === Iteration 48 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:15:59,147 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times
[2018-07-23 15:15:59,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:15:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:15:59,163 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:59,163 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:15:59,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-07-23 15:15:59,164 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:15:59,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:15:59,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:15:59,164 INFO L87 Difference]: Start difference. First operand 687 states and 1172 transitions. Second operand 10 states.
[2018-07-23 15:15:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:15:59,747 INFO L93 Difference]: Finished difference Result 826 states and 1381 transitions.
[2018-07-23 15:15:59,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-07-23 15:15:59,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:15:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:15:59,752 INFO L225 Difference]: With dead ends: 826
[2018-07-23 15:15:59,752 INFO L226 Difference]: Without dead ends: 824
[2018-07-23 15:15:59,753 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420
[2018-07-23 15:15:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states.
[2018-07-23 15:16:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 720.
[2018-07-23 15:16:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states.
[2018-07-23 15:16:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1226 transitions.
[2018-07-23 15:16:00,195 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1226 transitions. Word has length 15
[2018-07-23 15:16:00,196 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:00,196 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1226 transitions.
[2018-07-23 15:16:00,196 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1226 transitions.
[2018-07-23 15:16:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:00,197 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:00,197 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:00,197 INFO L414 AbstractCegarLoop]: === Iteration 49 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash -176946971, now seen corresponding path program 1 times
[2018-07-23 15:16:00,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:00,221 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:00,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-07-23 15:16:00,221 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:00,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:00,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:00,222 INFO L87 Difference]: Start difference. First operand 720 states and 1226 transitions. Second operand 10 states.
[2018-07-23 15:16:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:00,770 INFO L93 Difference]: Finished difference Result 843 states and 1413 transitions.
[2018-07-23 15:16:00,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-07-23 15:16:00,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:00,774 INFO L225 Difference]: With dead ends: 843
[2018-07-23 15:16:00,775 INFO L226 Difference]: Without dead ends: 841
[2018-07-23 15:16:00,775 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600
[2018-07-23 15:16:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states.
[2018-07-23 15:16:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 770.
[2018-07-23 15:16:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states.
[2018-07-23 15:16:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1300 transitions.
[2018-07-23 15:16:01,116 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1300 transitions. Word has length 15
[2018-07-23 15:16:01,116 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:01,117 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1300 transitions.
[2018-07-23 15:16:01,117 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1300 transitions.
[2018-07-23 15:16:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:01,118 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:01,118 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:01,118 INFO L414 AbstractCegarLoop]: === Iteration 50 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:01,118 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times
[2018-07-23 15:16:01,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:01,132 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:01,132 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:01,133 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:01,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:01,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:01,133 INFO L87 Difference]: Start difference. First operand 770 states and 1300 transitions. Second operand 10 states.
[2018-07-23 15:16:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:01,945 INFO L93 Difference]: Finished difference Result 960 states and 1623 transitions.
[2018-07-23 15:16:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-07-23 15:16:01,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:01,950 INFO L225 Difference]: With dead ends: 960
[2018-07-23 15:16:01,950 INFO L226 Difference]: Without dead ends: 958
[2018-07-23 15:16:01,951 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420
[2018-07-23 15:16:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states.
[2018-07-23 15:16:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 837.
[2018-07-23 15:16:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states.
[2018-07-23 15:16:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1422 transitions.
[2018-07-23 15:16:02,239 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1422 transitions. Word has length 15
[2018-07-23 15:16:02,239 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:02,239 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1422 transitions.
[2018-07-23 15:16:02,240 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1422 transitions.
[2018-07-23 15:16:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:02,241 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:02,241 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:02,241 INFO L414 AbstractCegarLoop]: === Iteration 51 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:02,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1949120374, now seen corresponding path program 2 times
[2018-07-23 15:16:02,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:02,255 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:02,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:02,255 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:02,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:02,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:02,256 INFO L87 Difference]: Start difference. First operand 837 states and 1422 transitions. Second operand 10 states.
[2018-07-23 15:16:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:03,010 INFO L93 Difference]: Finished difference Result 1027 states and 1720 transitions.
[2018-07-23 15:16:03,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-07-23 15:16:03,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:03,015 INFO L225 Difference]: With dead ends: 1027
[2018-07-23 15:16:03,015 INFO L226 Difference]: Without dead ends: 1025
[2018-07-23 15:16:03,016 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930
[2018-07-23 15:16:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states.
[2018-07-23 15:16:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 849.
[2018-07-23 15:16:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states.
[2018-07-23 15:16:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1445 transitions.
[2018-07-23 15:16:03,344 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1445 transitions. Word has length 15
[2018-07-23 15:16:03,344 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:03,344 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1445 transitions.
[2018-07-23 15:16:03,344 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1445 transitions.
[2018-07-23 15:16:03,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:03,345 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:03,346 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-07-23 15:16:03,346 INFO L414 AbstractCegarLoop]: === Iteration 52 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times
[2018-07-23 15:16:03,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:03,359 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:03,359 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:03,359 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:03,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:03,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:03,360 INFO L87 Difference]: Start difference. First operand 849 states and 1445 transitions. Second operand 10 states.
[2018-07-23 15:16:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:04,062 INFO L93 Difference]: Finished difference Result 1032 states and 1733 transitions.
[2018-07-23 15:16:04,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-07-23 15:16:04,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:04,067 INFO L225 Difference]: With dead ends: 1032
[2018-07-23 15:16:04,067 INFO L226 Difference]: Without dead ends: 1030
[2018-07-23 15:16:04,068 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870
[2018-07-23 15:16:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states.
[2018-07-23 15:16:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 869.
[2018-07-23 15:16:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states.
[2018-07-23 15:16:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1477 transitions.
[2018-07-23 15:16:04,408 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1477 transitions. Word has length 15
[2018-07-23 15:16:04,408 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:04,408 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1477 transitions.
[2018-07-23 15:16:04,409 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1477 transitions.
[2018-07-23 15:16:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:04,409 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:04,410 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:04,410 INFO L414 AbstractCegarLoop]: === Iteration 53 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:04,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1652283980, now seen corresponding path program 1 times
[2018-07-23 15:16:04,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:04,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:04,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:04,422 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:04,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:04,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:04,423 INFO L87 Difference]: Start difference. First operand 869 states and 1477 transitions. Second operand 10 states.
[2018-07-23 15:16:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:04,918 INFO L93 Difference]: Finished difference Result 945 states and 1593 transitions.
[2018-07-23 15:16:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:16:04,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:04,922 INFO L225 Difference]: With dead ends: 945
[2018-07-23 15:16:04,922 INFO L226 Difference]: Without dead ends: 943
[2018-07-23 15:16:04,922 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272
[2018-07-23 15:16:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states.
[2018-07-23 15:16:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 869.
[2018-07-23 15:16:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states.
[2018-07-23 15:16:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1474 transitions.
[2018-07-23 15:16:05,251 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1474 transitions. Word has length 15
[2018-07-23 15:16:05,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:05,251 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1474 transitions.
[2018-07-23 15:16:05,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1474 transitions.
[2018-07-23 15:16:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:05,252 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:05,252 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:05,253 INFO L414 AbstractCegarLoop]: === Iteration 54 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1643695811, now seen corresponding path program 1 times
[2018-07-23 15:16:05,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:05,262 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:05,263 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:05,263 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:05,263 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:05,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:05,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:05,264 INFO L87 Difference]: Start difference. First operand 869 states and 1474 transitions. Second operand 10 states.
[2018-07-23 15:16:05,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:05,813 INFO L93 Difference]: Finished difference Result 978 states and 1648 transitions.
[2018-07-23 15:16:05,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:16:05,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:05,817 INFO L225 Difference]: With dead ends: 978
[2018-07-23 15:16:05,817 INFO L226 Difference]: Without dead ends: 976
[2018-07-23 15:16:05,818 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272
[2018-07-23 15:16:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states.
[2018-07-23 15:16:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 871.
[2018-07-23 15:16:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states.
[2018-07-23 15:16:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1477 transitions.
[2018-07-23 15:16:06,125 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1477 transitions. Word has length 15
[2018-07-23 15:16:06,125 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:06,125 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1477 transitions.
[2018-07-23 15:16:06,125 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1477 transitions.
[2018-07-23 15:16:06,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:06,126 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:06,127 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:06,127 INFO L414 AbstractCegarLoop]: === Iteration 55 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:06,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1603552790, now seen corresponding path program 1 times
[2018-07-23 15:16:06,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:06,137 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:06,137 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:06,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:06,138 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:06,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:06,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:06,138 INFO L87 Difference]: Start difference. First operand 871 states and 1477 transitions. Second operand 10 states.
[2018-07-23 15:16:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:06,790 INFO L93 Difference]: Finished difference Result 1018 states and 1716 transitions.
[2018-07-23 15:16:06,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-07-23 15:16:06,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:06,795 INFO L225 Difference]: With dead ends: 1018
[2018-07-23 15:16:06,795 INFO L226 Difference]: Without dead ends: 1016
[2018-07-23 15:16:06,796 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600
[2018-07-23 15:16:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states.
[2018-07-23 15:16:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 931.
[2018-07-23 15:16:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states.
[2018-07-23 15:16:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1584 transitions.
[2018-07-23 15:16:07,123 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1584 transitions. Word has length 15
[2018-07-23 15:16:07,123 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:07,123 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1584 transitions.
[2018-07-23 15:16:07,123 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1584 transitions.
[2018-07-23 15:16:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:07,124 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:07,124 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:07,125 INFO L414 AbstractCegarLoop]: === Iteration 56 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash -38294824, now seen corresponding path program 2 times
[2018-07-23 15:16:07,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:07,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:07,136 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:07,136 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:07,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:07,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:07,137 INFO L87 Difference]: Start difference. First operand 931 states and 1584 transitions. Second operand 10 states.
[2018-07-23 15:16:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:07,667 INFO L93 Difference]: Finished difference Result 1157 states and 1937 transitions.
[2018-07-23 15:16:07,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-07-23 15:16:07,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:07,672 INFO L225 Difference]: With dead ends: 1157
[2018-07-23 15:16:07,672 INFO L226 Difference]: Without dead ends: 1155
[2018-07-23 15:16:07,673 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420
[2018-07-23 15:16:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states.
[2018-07-23 15:16:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 976.
[2018-07-23 15:16:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states.
[2018-07-23 15:16:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1662 transitions.
[2018-07-23 15:16:08,029 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1662 transitions. Word has length 15
[2018-07-23 15:16:08,030 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:08,030 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1662 transitions.
[2018-07-23 15:16:08,030 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1662 transitions.
[2018-07-23 15:16:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:08,031 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:08,031 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:08,031 INFO L414 AbstractCegarLoop]: === Iteration 57 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:08,031 INFO L82 PathProgramCache]: Analyzing trace with hash -29706655, now seen corresponding path program 2 times
[2018-07-23 15:16:08,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:08,039 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:08,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:08,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:08,040 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:08,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:08,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:08,041 INFO L87 Difference]: Start difference. First operand 976 states and 1662 transitions. Second operand 10 states.
[2018-07-23 15:16:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:08,601 INFO L93 Difference]: Finished difference Result 1198 states and 2004 transitions.
[2018-07-23 15:16:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:16:08,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:08,604 INFO L225 Difference]: With dead ends: 1198
[2018-07-23 15:16:08,604 INFO L226 Difference]: Without dead ends: 1196
[2018-07-23 15:16:08,605 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462
[2018-07-23 15:16:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states.
[2018-07-23 15:16:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 998.
[2018-07-23 15:16:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states.
[2018-07-23 15:16:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1695 transitions.
[2018-07-23 15:16:08,964 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1695 transitions. Word has length 15
[2018-07-23 15:16:08,964 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:08,964 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1695 transitions.
[2018-07-23 15:16:08,964 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1695 transitions.
[2018-07-23 15:16:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-07-23 15:16:08,965 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:08,965 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:08,965 INFO L414 AbstractCegarLoop]: === Iteration 58 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:08,965 INFO L82 PathProgramCache]: Analyzing trace with hash 10436366, now seen corresponding path program 2 times
[2018-07-23 15:16:08,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:08,975 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:08,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:08,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:08,975 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:08,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:08,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:08,976 INFO L87 Difference]: Start difference. First operand 998 states and 1695 transitions. Second operand 10 states.
[2018-07-23 15:16:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:09,482 INFO L93 Difference]: Finished difference Result 1161 states and 1935 transitions.
[2018-07-23 15:16:09,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-07-23 15:16:09,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15
[2018-07-23 15:16:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:09,485 INFO L225 Difference]: With dead ends: 1161
[2018-07-23 15:16:09,485 INFO L226 Difference]: Without dead ends: 1159
[2018-07-23 15:16:09,485 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650
[2018-07-23 15:16:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states.
[2018-07-23 15:16:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1022.
[2018-07-23 15:16:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states.
[2018-07-23 15:16:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1728 transitions.
[2018-07-23 15:16:09,885 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1728 transitions. Word has length 15
[2018-07-23 15:16:09,885 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:09,886 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1728 transitions.
[2018-07-23 15:16:09,886 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1728 transitions.
[2018-07-23 15:16:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-07-23 15:16:09,887 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:09,887 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:09,888 INFO L414 AbstractCegarLoop]: === Iteration 59 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:09,888 INFO L82 PathProgramCache]: Analyzing trace with hash 415120859, now seen corresponding path program 1 times
[2018-07-23 15:16:09,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:09,907 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:09,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:09,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-07-23 15:16:09,908 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-07-23 15:16:09,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-07-23 15:16:09,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2018-07-23 15:16:09,909 INFO L87 Difference]: Start difference. First operand 1022 states and 1728 transitions. Second operand 10 states.
[2018-07-23 15:16:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:10,509 INFO L93 Difference]: Finished difference Result 1173 states and 1946 transitions.
[2018-07-23 15:16:10,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-07-23 15:16:10,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16
[2018-07-23 15:16:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:10,511 INFO L225 Difference]: With dead ends: 1173
[2018-07-23 15:16:10,511 INFO L226 Difference]: Without dead ends: 1171
[2018-07-23 15:16:10,512 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506
[2018-07-23 15:16:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states.
[2018-07-23 15:16:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1065.
[2018-07-23 15:16:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states.
[2018-07-23 15:16:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1806 transitions.
[2018-07-23 15:16:10,896 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1806 transitions. Word has length 16
[2018-07-23 15:16:10,896 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:10,897 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1806 transitions.
[2018-07-23 15:16:10,897 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-07-23 15:16:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1806 transitions.
[2018-07-23 15:16:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-07-23 15:16:10,898 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:10,898 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:10,898 INFO L414 AbstractCegarLoop]: === Iteration 60 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1829543949, now seen corresponding path program 1 times
[2018-07-23 15:16:10,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-07-23 15:16:10,905 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:10,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:16:10,905 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:16:10,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:16:10,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:16:10,905 INFO L87 Difference]: Start difference. First operand 1065 states and 1806 transitions. Second operand 7 states.
[2018-07-23 15:16:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:11,580 INFO L93 Difference]: Finished difference Result 2706 states and 4565 transitions.
[2018-07-23 15:16:11,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-07-23 15:16:11,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2018-07-23 15:16:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:11,583 INFO L225 Difference]: With dead ends: 2706
[2018-07-23 15:16:11,583 INFO L226 Difference]: Without dead ends: 1625
[2018-07-23 15:16:11,585 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182
[2018-07-23 15:16:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states.
[2018-07-23 15:16:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1258.
[2018-07-23 15:16:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1258 states.
[2018-07-23 15:16:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 2139 transitions.
[2018-07-23 15:16:12,056 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 2139 transitions. Word has length 16
[2018-07-23 15:16:12,056 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:12,056 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 2139 transitions.
[2018-07-23 15:16:12,056 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:16:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2139 transitions.
[2018-07-23 15:16:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-07-23 15:16:12,058 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:12,058 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:12,058 INFO L414 AbstractCegarLoop]: === Iteration 61 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1269790439, now seen corresponding path program 1 times
[2018-07-23 15:16:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-07-23 15:16:12,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:12,067 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:16:12,067 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:16:12,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:16:12,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:16:12,067 INFO L87 Difference]: Start difference. First operand 1258 states and 2139 transitions. Second operand 7 states.
[2018-07-23 15:16:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:12,843 INFO L93 Difference]: Finished difference Result 3012 states and 5088 transitions.
[2018-07-23 15:16:12,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-07-23 15:16:12,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2018-07-23 15:16:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:12,847 INFO L225 Difference]: With dead ends: 3012
[2018-07-23 15:16:12,847 INFO L226 Difference]: Without dead ends: 1713
[2018-07-23 15:16:12,849 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2018-07-23 15:16:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states.
[2018-07-23 15:16:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1521.
[2018-07-23 15:16:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states.
[2018-07-23 15:16:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2545 transitions.
[2018-07-23 15:16:13,410 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2545 transitions. Word has length 16
[2018-07-23 15:16:13,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2545 transitions.
[2018-07-23 15:16:13,410 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:16:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2545 transitions.
[2018-07-23 15:16:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-07-23 15:16:13,411 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:13,411 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:13,412 INFO L414 AbstractCegarLoop]: === Iteration 62 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash 323600233, now seen corresponding path program 2 times
[2018-07-23 15:16:13,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-07-23 15:16:13,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:13,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-07-23 15:16:13,418 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-07-23 15:16:13,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-07-23 15:16:13,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-07-23 15:16:13,419 INFO L87 Difference]: Start difference. First operand 1521 states and 2545 transitions. Second operand 7 states.
[2018-07-23 15:16:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:14,282 INFO L93 Difference]: Finished difference Result 3615 states and 5961 transitions.
[2018-07-23 15:16:14,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-07-23 15:16:14,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2018-07-23 15:16:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:14,286 INFO L225 Difference]: With dead ends: 3615
[2018-07-23 15:16:14,286 INFO L226 Difference]: Without dead ends: 2069
[2018-07-23 15:16:14,289 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210
[2018-07-23 15:16:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states.
[2018-07-23 15:16:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1724.
[2018-07-23 15:16:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states.
[2018-07-23 15:16:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2809 transitions.
[2018-07-23 15:16:15,078 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2809 transitions. Word has length 16
[2018-07-23 15:16:15,078 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:15,078 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 2809 transitions.
[2018-07-23 15:16:15,078 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-07-23 15:16:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2809 transitions.
[2018-07-23 15:16:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-07-23 15:16:15,080 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:15,080 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:15,080 INFO L414 AbstractCegarLoop]: === Iteration 63 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1273855967, now seen corresponding path program 2 times
[2018-07-23 15:16:15,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:15,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:15,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-07-23 15:16:15,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:15,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:15,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:15,103 INFO L87 Difference]: Start difference. First operand 1724 states and 2809 transitions. Second operand 11 states.
[2018-07-23 15:16:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:16,196 INFO L93 Difference]: Finished difference Result 1829 states and 2955 transitions.
[2018-07-23 15:16:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-07-23 15:16:16,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17
[2018-07-23 15:16:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:16,200 INFO L225 Difference]: With dead ends: 1829
[2018-07-23 15:16:16,201 INFO L226 Difference]: Without dead ends: 1820
[2018-07-23 15:16:16,202 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332
[2018-07-23 15:16:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states.
[2018-07-23 15:16:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1714.
[2018-07-23 15:16:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states.
[2018-07-23 15:16:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2793 transitions.
[2018-07-23 15:16:17,095 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2793 transitions. Word has length 17
[2018-07-23 15:16:17,095 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:17,095 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2793 transitions.
[2018-07-23 15:16:17,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2793 transitions.
[2018-07-23 15:16:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:17,097 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:17,097 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-07-23 15:16:17,097 INFO L414 AbstractCegarLoop]: === Iteration 64 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1080543844, now seen corresponding path program 1 times
[2018-07-23 15:16:17,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-07-23 15:16:17,138 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:17,138 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:16:17,139 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:16:17,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:16:17,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:16:17,139 INFO L87 Difference]: Start difference. First operand 1714 states and 2793 transitions. Second operand 12 states.
[2018-07-23 15:16:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:17,965 INFO L93 Difference]: Finished difference Result 1784 states and 2895 transitions.
[2018-07-23 15:16:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-07-23 15:16:17,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18
[2018-07-23 15:16:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:17,969 INFO L225 Difference]: With dead ends: 1784
[2018-07-23 15:16:17,970 INFO L226 Difference]: Without dead ends: 1783
[2018-07-23 15:16:17,971 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552
[2018-07-23 15:16:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states.
[2018-07-23 15:16:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1719.
[2018-07-23 15:16:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states.
[2018-07-23 15:16:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2802 transitions.
[2018-07-23 15:16:18,950 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2802 transitions. Word has length 18
[2018-07-23 15:16:18,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:18,950 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2802 transitions.
[2018-07-23 15:16:18,950 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:16:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2802 transitions.
[2018-07-23 15:16:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:18,951 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:18,951 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:18,952 INFO L414 AbstractCegarLoop]: === Iteration 65 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:18,952 INFO L82 PathProgramCache]: Analyzing trace with hash 818532565, now seen corresponding path program 1 times
[2018-07-23 15:16:18,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:18,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:18,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:16:18,978 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:16:18,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:16:18,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:16:18,979 INFO L87 Difference]: Start difference. First operand 1719 states and 2802 transitions. Second operand 12 states.
[2018-07-23 15:16:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:19,987 INFO L93 Difference]: Finished difference Result 1783 states and 2889 transitions.
[2018-07-23 15:16:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-07-23 15:16:19,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18
[2018-07-23 15:16:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:19,991 INFO L225 Difference]: With dead ends: 1783
[2018-07-23 15:16:19,991 INFO L226 Difference]: Without dead ends: 1781
[2018-07-23 15:16:19,992 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506
[2018-07-23 15:16:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states.
[2018-07-23 15:16:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1723.
[2018-07-23 15:16:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states.
[2018-07-23 15:16:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions.
[2018-07-23 15:16:20,766 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 18
[2018-07-23 15:16:20,766 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:20,767 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions.
[2018-07-23 15:16:20,767 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:16:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions.
[2018-07-23 15:16:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:20,768 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:20,768 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-07-23 15:16:20,769 INFO L414 AbstractCegarLoop]: === Iteration 66 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:20,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1629794958, now seen corresponding path program 2 times
[2018-07-23 15:16:20,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-07-23 15:16:20,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:20,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:16:20,802 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:16:20,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:16:20,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:16:20,802 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 12 states.
[2018-07-23 15:16:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:21,948 INFO L93 Difference]: Finished difference Result 2036 states and 3314 transitions.
[2018-07-23 15:16:21,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-07-23 15:16:21,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18
[2018-07-23 15:16:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:21,951 INFO L225 Difference]: With dead ends: 2036
[2018-07-23 15:16:21,951 INFO L226 Difference]: Without dead ends: 2035
[2018-07-23 15:16:21,952 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650
[2018-07-23 15:16:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states.
[2018-07-23 15:16:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1858.
[2018-07-23 15:16:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states.
[2018-07-23 15:16:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3040 transitions.
[2018-07-23 15:16:22,811 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3040 transitions. Word has length 18
[2018-07-23 15:16:22,811 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:22,811 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 3040 transitions.
[2018-07-23 15:16:22,811 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:16:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3040 transitions.
[2018-07-23 15:16:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:22,813 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:22,813 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:22,813 INFO L414 AbstractCegarLoop]: === Iteration 67 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash -446449989, now seen corresponding path program 1 times
[2018-07-23 15:16:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:22,829 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:16:22,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:22,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:22,830 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:22,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:22,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:22,830 INFO L87 Difference]: Start difference. First operand 1858 states and 3040 transitions. Second operand 11 states.
[2018-07-23 15:16:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:23,755 INFO L93 Difference]: Finished difference Result 2046 states and 3338 transitions.
[2018-07-23 15:16:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-07-23 15:16:23,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:23,758 INFO L225 Difference]: With dead ends: 2046
[2018-07-23 15:16:23,758 INFO L226 Difference]: Without dead ends: 2044
[2018-07-23 15:16:23,759 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702
[2018-07-23 15:16:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states.
[2018-07-23 15:16:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1922.
[2018-07-23 15:16:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states.
[2018-07-23 15:16:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 3155 transitions.
[2018-07-23 15:16:24,515 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 3155 transitions. Word has length 18
[2018-07-23 15:16:24,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:24,515 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 3155 transitions.
[2018-07-23 15:16:24,515 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 3155 transitions.
[2018-07-23 15:16:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:24,517 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:24,517 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:24,517 INFO L414 AbstractCegarLoop]: === Iteration 68 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:24,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times
[2018-07-23 15:16:24,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:24,531 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:24,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:24,532 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:24,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:24,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:24,532 INFO L87 Difference]: Start difference. First operand 1922 states and 3155 transitions. Second operand 11 states.
[2018-07-23 15:16:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:25,620 INFO L93 Difference]: Finished difference Result 2251 states and 3688 transitions.
[2018-07-23 15:16:25,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-07-23 15:16:25,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:25,622 INFO L225 Difference]: With dead ends: 2251
[2018-07-23 15:16:25,623 INFO L226 Difference]: Without dead ends: 2249
[2018-07-23 15:16:25,623 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756
[2018-07-23 15:16:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states.
[2018-07-23 15:16:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2029.
[2018-07-23 15:16:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states.
[2018-07-23 15:16:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3346 transitions.
[2018-07-23 15:16:26,406 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3346 transitions. Word has length 18
[2018-07-23 15:16:26,406 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:26,406 INFO L471 AbstractCegarLoop]: Abstraction has 2029 states and 3346 transitions.
[2018-07-23 15:16:26,406 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3346 transitions.
[2018-07-23 15:16:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:26,407 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:26,407 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:26,407 INFO L414 AbstractCegarLoop]: === Iteration 69 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:26,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310343, now seen corresponding path program 3 times
[2018-07-23 15:16:26,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:26,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:26,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:16:26,425 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:16:26,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:16:26,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:16:26,426 INFO L87 Difference]: Start difference. First operand 2029 states and 3346 transitions. Second operand 13 states.
[2018-07-23 15:16:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:27,332 INFO L93 Difference]: Finished difference Result 2101 states and 3451 transitions.
[2018-07-23 15:16:27,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:16:27,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18
[2018-07-23 15:16:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:27,335 INFO L225 Difference]: With dead ends: 2101
[2018-07-23 15:16:27,335 INFO L226 Difference]: Without dead ends: 2100
[2018-07-23 15:16:27,335 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420
[2018-07-23 15:16:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2018-07-23 15:16:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2029.
[2018-07-23 15:16:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states.
[2018-07-23 15:16:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3343 transitions.
[2018-07-23 15:16:28,127 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3343 transitions. Word has length 18
[2018-07-23 15:16:28,127 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:28,127 INFO L471 AbstractCegarLoop]: Abstraction has 2029 states and 3343 transitions.
[2018-07-23 15:16:28,127 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:16:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3343 transitions.
[2018-07-23 15:16:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:28,128 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:28,129 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:28,129 INFO L414 AbstractCegarLoop]: === Iteration 70 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1235464429, now seen corresponding path program 2 times
[2018-07-23 15:16:28,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:28,141 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:16:28,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:28,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:28,141 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:28,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:28,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:28,142 INFO L87 Difference]: Start difference. First operand 2029 states and 3343 transitions. Second operand 11 states.
[2018-07-23 15:16:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:29,340 INFO L93 Difference]: Finished difference Result 2256 states and 3702 transitions.
[2018-07-23 15:16:29,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-07-23 15:16:29,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:29,342 INFO L225 Difference]: With dead ends: 2256
[2018-07-23 15:16:29,342 INFO L226 Difference]: Without dead ends: 2254
[2018-07-23 15:16:29,343 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650
[2018-07-23 15:16:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states.
[2018-07-23 15:16:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2040.
[2018-07-23 15:16:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states.
[2018-07-23 15:16:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3369 transitions.
[2018-07-23 15:16:30,134 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3369 transitions. Word has length 18
[2018-07-23 15:16:30,135 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:30,135 INFO L471 AbstractCegarLoop]: Abstraction has 2040 states and 3369 transitions.
[2018-07-23 15:16:30,135 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3369 transitions.
[2018-07-23 15:16:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:30,136 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:30,136 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-07-23 15:16:30,136 INFO L414 AbstractCegarLoop]: === Iteration 71 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash -111984382, now seen corresponding path program 4 times
[2018-07-23 15:16:30,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-07-23 15:16:30,147 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:30,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:16:30,147 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:16:30,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:16:30,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:16:30,148 INFO L87 Difference]: Start difference. First operand 2040 states and 3369 transitions. Second operand 12 states.
[2018-07-23 15:16:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:31,232 INFO L93 Difference]: Finished difference Result 2243 states and 3672 transitions.
[2018-07-23 15:16:31,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-07-23 15:16:31,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18
[2018-07-23 15:16:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:31,235 INFO L225 Difference]: With dead ends: 2243
[2018-07-23 15:16:31,235 INFO L226 Difference]: Without dead ends: 2242
[2018-07-23 15:16:31,235 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812
[2018-07-23 15:16:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states.
[2018-07-23 15:16:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2029.
[2018-07-23 15:16:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states.
[2018-07-23 15:16:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3348 transitions.
[2018-07-23 15:16:32,045 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3348 transitions. Word has length 18
[2018-07-23 15:16:32,045 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:32,045 INFO L471 AbstractCegarLoop]: Abstraction has 2029 states and 3348 transitions.
[2018-07-23 15:16:32,045 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:16:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3348 transitions.
[2018-07-23 15:16:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:32,046 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:32,046 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:32,046 INFO L414 AbstractCegarLoop]: === Iteration 72 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:32,047 INFO L82 PathProgramCache]: Analyzing trace with hash -111983100, now seen corresponding path program 1 times
[2018-07-23 15:16:32,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:32,060 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:32,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:32,061 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:32,061 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:32,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:32,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:32,061 INFO L87 Difference]: Start difference. First operand 2029 states and 3348 transitions. Second operand 11 states.
[2018-07-23 15:16:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:33,186 INFO L93 Difference]: Finished difference Result 2267 states and 3717 transitions.
[2018-07-23 15:16:33,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-07-23 15:16:33,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:33,189 INFO L225 Difference]: With dead ends: 2267
[2018-07-23 15:16:33,189 INFO L226 Difference]: Without dead ends: 2265
[2018-07-23 15:16:33,190 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756
[2018-07-23 15:16:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states.
[2018-07-23 15:16:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2063.
[2018-07-23 15:16:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states.
[2018-07-23 15:16:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3413 transitions.
[2018-07-23 15:16:34,009 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3413 transitions. Word has length 18
[2018-07-23 15:16:34,009 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:34,009 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 3413 transitions.
[2018-07-23 15:16:34,009 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3413 transitions.
[2018-07-23 15:16:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:34,010 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:34,010 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:34,010 INFO L414 AbstractCegarLoop]: === Iteration 73 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash -103396213, now seen corresponding path program 2 times
[2018-07-23 15:16:34,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:34,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:34,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:34,023 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:34,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:34,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:34,024 INFO L87 Difference]: Start difference. First operand 2063 states and 3413 transitions. Second operand 11 states.
[2018-07-23 15:16:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:35,082 INFO L93 Difference]: Finished difference Result 2234 states and 3657 transitions.
[2018-07-23 15:16:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-07-23 15:16:35,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:35,084 INFO L225 Difference]: With dead ends: 2234
[2018-07-23 15:16:35,085 INFO L226 Difference]: Without dead ends: 2232
[2018-07-23 15:16:35,085 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702
[2018-07-23 15:16:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states.
[2018-07-23 15:16:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2062.
[2018-07-23 15:16:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states.
[2018-07-23 15:16:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3410 transitions.
[2018-07-23 15:16:35,911 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3410 transitions. Word has length 18
[2018-07-23 15:16:35,911 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:35,911 INFO L471 AbstractCegarLoop]: Abstraction has 2062 states and 3410 transitions.
[2018-07-23 15:16:35,911 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3410 transitions.
[2018-07-23 15:16:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:35,912 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:35,912 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:35,912 INFO L414 AbstractCegarLoop]: === Iteration 74 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash -103395925, now seen corresponding path program 5 times
[2018-07-23 15:16:35,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:35,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:35,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:16:35,934 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:16:35,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:16:35,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:16:35,934 INFO L87 Difference]: Start difference. First operand 2062 states and 3410 transitions. Second operand 13 states.
[2018-07-23 15:16:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:37,097 INFO L93 Difference]: Finished difference Result 2220 states and 3648 transitions.
[2018-07-23 15:16:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-07-23 15:16:37,097 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18
[2018-07-23 15:16:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:37,100 INFO L225 Difference]: With dead ends: 2220
[2018-07-23 15:16:37,100 INFO L226 Difference]: Without dead ends: 2219
[2018-07-23 15:16:37,101 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506
[2018-07-23 15:16:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states.
[2018-07-23 15:16:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2062.
[2018-07-23 15:16:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states.
[2018-07-23 15:16:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 3406 transitions.
[2018-07-23 15:16:37,937 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 3406 transitions. Word has length 18
[2018-07-23 15:16:37,937 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:37,937 INFO L471 AbstractCegarLoop]: Abstraction has 2062 states and 3406 transitions.
[2018-07-23 15:16:37,937 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:16:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 3406 transitions.
[2018-07-23 15:16:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:37,938 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:37,938 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:37,939 INFO L414 AbstractCegarLoop]: === Iteration 75 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times
[2018-07-23 15:16:37,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:37,951 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:37,951 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:37,951 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:37,952 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:37,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:37,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:37,952 INFO L87 Difference]: Start difference. First operand 2062 states and 3406 transitions. Second operand 11 states.
[2018-07-23 15:16:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:39,122 INFO L93 Difference]: Finished difference Result 2348 states and 3848 transitions.
[2018-07-23 15:16:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-07-23 15:16:39,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:39,125 INFO L225 Difference]: With dead ends: 2348
[2018-07-23 15:16:39,125 INFO L226 Difference]: Without dead ends: 2346
[2018-07-23 15:16:39,126 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930
[2018-07-23 15:16:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states.
[2018-07-23 15:16:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2069.
[2018-07-23 15:16:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states.
[2018-07-23 15:16:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3421 transitions.
[2018-07-23 15:16:39,965 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3421 transitions. Word has length 18
[2018-07-23 15:16:39,965 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:39,965 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3421 transitions.
[2018-07-23 15:16:39,965 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3421 transitions.
[2018-07-23 15:16:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:39,966 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:39,966 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:39,966 INFO L414 AbstractCegarLoop]: === Iteration 76 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 3 times
[2018-07-23 15:16:39,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:39,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:39,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:39,982 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:39,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:39,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:39,982 INFO L87 Difference]: Start difference. First operand 2069 states and 3421 transitions. Second operand 11 states.
[2018-07-23 15:16:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:41,149 INFO L93 Difference]: Finished difference Result 2308 states and 3773 transitions.
[2018-07-23 15:16:41,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-07-23 15:16:41,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:41,152 INFO L225 Difference]: With dead ends: 2308
[2018-07-23 15:16:41,152 INFO L226 Difference]: Without dead ends: 2306
[2018-07-23 15:16:41,153 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870
[2018-07-23 15:16:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states.
[2018-07-23 15:16:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2060.
[2018-07-23 15:16:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2060 states.
[2018-07-23 15:16:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3397 transitions.
[2018-07-23 15:16:41,998 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3397 transitions. Word has length 18
[2018-07-23 15:16:41,998 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:41,998 INFO L471 AbstractCegarLoop]: Abstraction has 2060 states and 3397 transitions.
[2018-07-23 15:16:41,998 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3397 transitions.
[2018-07-23 15:16:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:41,999 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:41,999 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:41,999 INFO L414 AbstractCegarLoop]: === Iteration 77 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:42,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170099, now seen corresponding path program 6 times
[2018-07-23 15:16:42,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:42,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:42,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:16:42,011 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:16:42,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:16:42,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:16:42,011 INFO L87 Difference]: Start difference. First operand 2060 states and 3397 transitions. Second operand 13 states.
[2018-07-23 15:16:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:43,233 INFO L93 Difference]: Finished difference Result 2308 states and 3783 transitions.
[2018-07-23 15:16:43,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-07-23 15:16:43,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18
[2018-07-23 15:16:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:43,235 INFO L225 Difference]: With dead ends: 2308
[2018-07-23 15:16:43,235 INFO L226 Difference]: Without dead ends: 2307
[2018-07-23 15:16:43,236 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650
[2018-07-23 15:16:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states.
[2018-07-23 15:16:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2057.
[2018-07-23 15:16:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states.
[2018-07-23 15:16:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3387 transitions.
[2018-07-23 15:16:44,194 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3387 transitions. Word has length 18
[2018-07-23 15:16:44,195 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:44,195 INFO L471 AbstractCegarLoop]: Abstraction has 2057 states and 3387 transitions.
[2018-07-23 15:16:44,195 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:16:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3387 transitions.
[2018-07-23 15:16:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:44,196 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:44,196 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:44,196 INFO L414 AbstractCegarLoop]: === Iteration 78 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1198893179, now seen corresponding path program 4 times
[2018-07-23 15:16:44,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:44,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:44,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:44,209 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:44,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:44,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:44,210 INFO L87 Difference]: Start difference. First operand 2057 states and 3387 transitions. Second operand 11 states.
[2018-07-23 15:16:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:45,465 INFO L93 Difference]: Finished difference Result 2380 states and 3900 transitions.
[2018-07-23 15:16:45,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-07-23 15:16:45,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:45,468 INFO L225 Difference]: With dead ends: 2380
[2018-07-23 15:16:45,468 INFO L226 Difference]: Without dead ends: 2378
[2018-07-23 15:16:45,469 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756
[2018-07-23 15:16:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states.
[2018-07-23 15:16:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2049.
[2018-07-23 15:16:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states.
[2018-07-23 15:16:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 3368 transitions.
[2018-07-23 15:16:46,325 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 3368 transitions. Word has length 18
[2018-07-23 15:16:46,325 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:46,325 INFO L471 AbstractCegarLoop]: Abstraction has 2049 states and 3368 transitions.
[2018-07-23 15:16:46,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 3368 transitions.
[2018-07-23 15:16:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:46,326 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:46,327 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:46,327 INFO L414 AbstractCegarLoop]: === Iteration 79 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1428793719, now seen corresponding path program 1 times
[2018-07-23 15:16:46,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:46,339 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:16:46,339 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:46,339 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:46,339 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:46,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:46,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:46,339 INFO L87 Difference]: Start difference. First operand 2049 states and 3368 transitions. Second operand 11 states.
[2018-07-23 15:16:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:47,374 INFO L93 Difference]: Finished difference Result 2143 states and 3512 transitions.
[2018-07-23 15:16:47,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-07-23 15:16:47,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:47,377 INFO L225 Difference]: With dead ends: 2143
[2018-07-23 15:16:47,377 INFO L226 Difference]: Without dead ends: 2141
[2018-07-23 15:16:47,378 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342
[2018-07-23 15:16:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states.
[2018-07-23 15:16:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2055.
[2018-07-23 15:16:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states.
[2018-07-23 15:16:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3378 transitions.
[2018-07-23 15:16:48,244 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3378 transitions. Word has length 18
[2018-07-23 15:16:48,244 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:48,244 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 3378 transitions.
[2018-07-23 15:16:48,244 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3378 transitions.
[2018-07-23 15:16:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-07-23 15:16:48,245 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:48,245 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:48,245 INFO L414 AbstractCegarLoop]: === Iteration 80 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash 383805696, now seen corresponding path program 1 times
[2018-07-23 15:16:48,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:48,256 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:48,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:48,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:16:48,256 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-07-23 15:16:48,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-07-23 15:16:48,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2018-07-23 15:16:48,257 INFO L87 Difference]: Start difference. First operand 2055 states and 3378 transitions. Second operand 11 states.
[2018-07-23 15:16:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:49,331 INFO L93 Difference]: Finished difference Result 2243 states and 3674 transitions.
[2018-07-23 15:16:49,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-07-23 15:16:49,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18
[2018-07-23 15:16:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:49,333 INFO L225 Difference]: With dead ends: 2243
[2018-07-23 15:16:49,333 INFO L226 Difference]: Without dead ends: 2241
[2018-07-23 15:16:49,334 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380
[2018-07-23 15:16:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states.
[2018-07-23 15:16:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2072.
[2018-07-23 15:16:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states.
[2018-07-23 15:16:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3406 transitions.
[2018-07-23 15:16:50,236 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3406 transitions. Word has length 18
[2018-07-23 15:16:50,236 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:50,237 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3406 transitions.
[2018-07-23 15:16:50,237 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-07-23 15:16:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3406 transitions.
[2018-07-23 15:16:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:16:50,239 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:50,239 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:50,239 INFO L414 AbstractCegarLoop]: === Iteration 81 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times
[2018-07-23 15:16:50,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:50,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:50,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:16:50,260 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:16:50,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:16:50,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:16:50,260 INFO L87 Difference]: Start difference. First operand 2072 states and 3406 transitions. Second operand 13 states.
[2018-07-23 15:16:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:51,400 INFO L93 Difference]: Finished difference Result 2153 states and 3525 transitions.
[2018-07-23 15:16:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-07-23 15:16:51,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19
[2018-07-23 15:16:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:51,403 INFO L225 Difference]: With dead ends: 2153
[2018-07-23 15:16:51,403 INFO L226 Difference]: Without dead ends: 2152
[2018-07-23 15:16:51,404 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992
[2018-07-23 15:16:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states.
[2018-07-23 15:16:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2082.
[2018-07-23 15:16:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states.
[2018-07-23 15:16:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3423 transitions.
[2018-07-23 15:16:52,323 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3423 transitions. Word has length 19
[2018-07-23 15:16:52,323 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:52,324 INFO L471 AbstractCegarLoop]: Abstraction has 2082 states and 3423 transitions.
[2018-07-23 15:16:52,324 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:16:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3423 transitions.
[2018-07-23 15:16:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:16:52,325 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:52,325 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:52,325 INFO L414 AbstractCegarLoop]: === Iteration 82 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1639758835, now seen corresponding path program 1 times
[2018-07-23 15:16:52,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:52,343 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:52,343 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:52,343 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:16:52,344 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:16:52,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:16:52,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:16:52,344 INFO L87 Difference]: Start difference. First operand 2082 states and 3423 transitions. Second operand 13 states.
[2018-07-23 15:16:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:53,581 INFO L93 Difference]: Finished difference Result 2189 states and 3589 transitions.
[2018-07-23 15:16:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-07-23 15:16:53,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19
[2018-07-23 15:16:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:53,583 INFO L225 Difference]: With dead ends: 2189
[2018-07-23 15:16:53,584 INFO L226 Difference]: Without dead ends: 2187
[2018-07-23 15:16:53,584 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260
[2018-07-23 15:16:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states.
[2018-07-23 15:16:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2100.
[2018-07-23 15:16:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states.
[2018-07-23 15:16:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3458 transitions.
[2018-07-23 15:16:54,494 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3458 transitions. Word has length 19
[2018-07-23 15:16:54,494 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:54,494 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 3458 transitions.
[2018-07-23 15:16:54,494 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:16:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3458 transitions.
[2018-07-23 15:16:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:16:54,495 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:54,495 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:54,495 INFO L414 AbstractCegarLoop]: === Iteration 83 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:54,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2095454951, now seen corresponding path program 2 times
[2018-07-23 15:16:54,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:54,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:54,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:16:54,516 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:16:54,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:16:54,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:16:54,517 INFO L87 Difference]: Start difference. First operand 2100 states and 3458 transitions. Second operand 12 states.
[2018-07-23 15:16:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:55,698 INFO L93 Difference]: Finished difference Result 2277 states and 3736 transitions.
[2018-07-23 15:16:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-07-23 15:16:55,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19
[2018-07-23 15:16:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:55,701 INFO L225 Difference]: With dead ends: 2277
[2018-07-23 15:16:55,701 INFO L226 Difference]: Without dead ends: 2275
[2018-07-23 15:16:55,701 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812
[2018-07-23 15:16:55,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states.
[2018-07-23 15:16:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2170.
[2018-07-23 15:16:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states.
[2018-07-23 15:16:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3573 transitions.
[2018-07-23 15:16:56,678 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3573 transitions. Word has length 19
[2018-07-23 15:16:56,678 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:56,678 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3573 transitions.
[2018-07-23 15:16:56,678 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:16:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3573 transitions.
[2018-07-23 15:16:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:16:56,679 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:56,679 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:56,679 INFO L414 AbstractCegarLoop]: === Iteration 84 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1599772939, now seen corresponding path program 3 times
[2018-07-23 15:16:56,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:16:56,702 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:56,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:16:56,702 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:16:56,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:16:56,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:16:56,703 INFO L87 Difference]: Start difference. First operand 2170 states and 3573 transitions. Second operand 12 states.
[2018-07-23 15:16:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:16:58,134 INFO L93 Difference]: Finished difference Result 2400 states and 3933 transitions.
[2018-07-23 15:16:58,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-07-23 15:16:58,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19
[2018-07-23 15:16:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:16:58,137 INFO L225 Difference]: With dead ends: 2400
[2018-07-23 15:16:58,137 INFO L226 Difference]: Without dead ends: 2398
[2018-07-23 15:16:58,137 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406
[2018-07-23 15:16:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states.
[2018-07-23 15:16:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2146.
[2018-07-23 15:16:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states.
[2018-07-23 15:16:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3536 transitions.
[2018-07-23 15:16:59,104 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3536 transitions. Word has length 19
[2018-07-23 15:16:59,104 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:16:59,104 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 3536 transitions.
[2018-07-23 15:16:59,104 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:16:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3536 transitions.
[2018-07-23 15:16:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:16:59,106 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:16:59,106 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:16:59,106 INFO L414 AbstractCegarLoop]: === Iteration 85 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:16:59,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1654744567, now seen corresponding path program 1 times
[2018-07-23 15:16:59,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:16:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:16:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-07-23 15:16:59,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:16:59,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-07-23 15:16:59,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-07-23 15:16:59,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-07-23 15:16:59,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-07-23 15:16:59,116 INFO L87 Difference]: Start difference. First operand 2146 states and 3536 transitions. Second operand 8 states.
[2018-07-23 15:17:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:00,394 INFO L93 Difference]: Finished difference Result 4383 states and 7138 transitions.
[2018-07-23 15:17:00,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-07-23 15:17:00,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19
[2018-07-23 15:17:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:00,397 INFO L225 Difference]: With dead ends: 4383
[2018-07-23 15:17:00,397 INFO L226 Difference]: Without dead ends: 2069
[2018-07-23 15:17:00,400 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306
[2018-07-23 15:17:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states.
[2018-07-23 15:17:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1775.
[2018-07-23 15:17:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states.
[2018-07-23 15:17:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2940 transitions.
[2018-07-23 15:17:01,237 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2940 transitions. Word has length 19
[2018-07-23 15:17:01,237 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:01,237 INFO L471 AbstractCegarLoop]: Abstraction has 1775 states and 2940 transitions.
[2018-07-23 15:17:01,237 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-07-23 15:17:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2940 transitions.
[2018-07-23 15:17:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:01,239 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:01,239 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:01,239 INFO L414 AbstractCegarLoop]: === Iteration 86 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times
[2018-07-23 15:17:01,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:01,256 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:17:01,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:01,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:17:01,257 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:17:01,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:17:01,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:17:01,258 INFO L87 Difference]: Start difference. First operand 1775 states and 2940 transitions. Second operand 13 states.
[2018-07-23 15:17:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:02,670 INFO L93 Difference]: Finished difference Result 2136 states and 3539 transitions.
[2018-07-23 15:17:02,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-07-23 15:17:02,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19
[2018-07-23 15:17:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:02,672 INFO L225 Difference]: With dead ends: 2136
[2018-07-23 15:17:02,672 INFO L226 Difference]: Without dead ends: 2134
[2018-07-23 15:17:02,673 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870
[2018-07-23 15:17:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states.
[2018-07-23 15:17:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1982.
[2018-07-23 15:17:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states.
[2018-07-23 15:17:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 3302 transitions.
[2018-07-23 15:17:03,652 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 3302 transitions. Word has length 19
[2018-07-23 15:17:03,652 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:03,652 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 3302 transitions.
[2018-07-23 15:17:03,653 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:17:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 3302 transitions.
[2018-07-23 15:17:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:03,654 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:03,654 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:03,654 INFO L414 AbstractCegarLoop]: === Iteration 87 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:03,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times
[2018-07-23 15:17:03,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:17:03,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:03,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:17:03,669 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:17:03,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:17:03,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:17:03,670 INFO L87 Difference]: Start difference. First operand 1982 states and 3302 transitions. Second operand 13 states.
[2018-07-23 15:17:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:05,835 INFO L93 Difference]: Finished difference Result 2923 states and 4923 transitions.
[2018-07-23 15:17:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-07-23 15:17:05,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19
[2018-07-23 15:17:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:05,838 INFO L225 Difference]: With dead ends: 2923
[2018-07-23 15:17:05,838 INFO L226 Difference]: Without dead ends: 2921
[2018-07-23 15:17:05,839 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806
[2018-07-23 15:17:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states.
[2018-07-23 15:17:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2165.
[2018-07-23 15:17:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states.
[2018-07-23 15:17:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3628 transitions.
[2018-07-23 15:17:06,936 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3628 transitions. Word has length 19
[2018-07-23 15:17:06,936 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:06,936 INFO L471 AbstractCegarLoop]: Abstraction has 2165 states and 3628 transitions.
[2018-07-23 15:17:06,936 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:17:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3628 transitions.
[2018-07-23 15:17:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:06,937 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:06,938 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:06,938 INFO L414 AbstractCegarLoop]: === Iteration 88 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1180644619, now seen corresponding path program 1 times
[2018-07-23 15:17:06,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:17:06,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:06,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:06,960 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:06,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:06,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:06,960 INFO L87 Difference]: Start difference. First operand 2165 states and 3628 transitions. Second operand 12 states.
[2018-07-23 15:17:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:08,594 INFO L93 Difference]: Finished difference Result 2392 states and 3991 transitions.
[2018-07-23 15:17:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-07-23 15:17:08,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19
[2018-07-23 15:17:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:08,597 INFO L225 Difference]: With dead ends: 2392
[2018-07-23 15:17:08,597 INFO L226 Difference]: Without dead ends: 2391
[2018-07-23 15:17:08,598 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406
[2018-07-23 15:17:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states.
[2018-07-23 15:17:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2238.
[2018-07-23 15:17:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states.
[2018-07-23 15:17:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3754 transitions.
[2018-07-23 15:17:09,718 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3754 transitions. Word has length 19
[2018-07-23 15:17:09,719 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:09,719 INFO L471 AbstractCegarLoop]: Abstraction has 2238 states and 3754 transitions.
[2018-07-23 15:17:09,719 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3754 transitions.
[2018-07-23 15:17:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:09,720 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:09,720 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:09,720 INFO L414 AbstractCegarLoop]: === Iteration 89 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1537034535, now seen corresponding path program 1 times
[2018-07-23 15:17:09,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:09,740 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:17:09,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:09,741 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:09,741 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:09,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:09,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:09,741 INFO L87 Difference]: Start difference. First operand 2238 states and 3754 transitions. Second operand 12 states.
[2018-07-23 15:17:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:11,386 INFO L93 Difference]: Finished difference Result 2500 states and 4176 transitions.
[2018-07-23 15:17:11,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2018-07-23 15:17:11,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19
[2018-07-23 15:17:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:11,389 INFO L225 Difference]: With dead ends: 2500
[2018-07-23 15:17:11,389 INFO L226 Difference]: Without dead ends: 2498
[2018-07-23 15:17:11,389 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=464, Invalid=1888, Unknown=0, NotChecked=0, Total=2352
[2018-07-23 15:17:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states.
[2018-07-23 15:17:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2319.
[2018-07-23 15:17:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states.
[2018-07-23 15:17:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3903 transitions.
[2018-07-23 15:17:12,574 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3903 transitions. Word has length 19
[2018-07-23 15:17:12,574 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:12,574 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3903 transitions.
[2018-07-23 15:17:12,574 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3903 transitions.
[2018-07-23 15:17:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:12,576 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:12,576 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:12,576 INFO L414 AbstractCegarLoop]: === Iteration 90 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1313246452, now seen corresponding path program 2 times
[2018-07-23 15:17:12,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:12,588 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:17:12,588 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:12,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:17:12,588 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:17:12,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:17:12,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:17:12,589 INFO L87 Difference]: Start difference. First operand 2319 states and 3903 transitions. Second operand 13 states.
[2018-07-23 15:17:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:15,183 INFO L93 Difference]: Finished difference Result 3166 states and 5350 transitions.
[2018-07-23 15:17:15,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-07-23 15:17:15,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19
[2018-07-23 15:17:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:15,186 INFO L225 Difference]: With dead ends: 3166
[2018-07-23 15:17:15,186 INFO L226 Difference]: Without dead ends: 3164
[2018-07-23 15:17:15,187 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122
[2018-07-23 15:17:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states.
[2018-07-23 15:17:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2660.
[2018-07-23 15:17:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states.
[2018-07-23 15:17:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4506 transitions.
[2018-07-23 15:17:16,620 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4506 transitions. Word has length 19
[2018-07-23 15:17:16,620 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:16,620 INFO L471 AbstractCegarLoop]: Abstraction has 2660 states and 4506 transitions.
[2018-07-23 15:17:16,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:17:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4506 transitions.
[2018-07-23 15:17:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:16,622 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:16,622 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:16,622 INFO L414 AbstractCegarLoop]: === Iteration 91 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1262707917, now seen corresponding path program 1 times
[2018-07-23 15:17:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:16,637 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:17:16,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:16,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:16,637 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:16,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:16,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:16,638 INFO L87 Difference]: Start difference. First operand 2660 states and 4506 transitions. Second operand 12 states.
[2018-07-23 15:17:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:18,399 INFO L93 Difference]: Finished difference Result 2926 states and 4919 transitions.
[2018-07-23 15:17:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-07-23 15:17:18,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19
[2018-07-23 15:17:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:18,403 INFO L225 Difference]: With dead ends: 2926
[2018-07-23 15:17:18,403 INFO L226 Difference]: Without dead ends: 2925
[2018-07-23 15:17:18,404 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870
[2018-07-23 15:17:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states.
[2018-07-23 15:17:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2743.
[2018-07-23 15:17:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states.
[2018-07-23 15:17:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4635 transitions.
[2018-07-23 15:17:19,922 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4635 transitions. Word has length 19
[2018-07-23 15:17:19,922 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:19,922 INFO L471 AbstractCegarLoop]: Abstraction has 2743 states and 4635 transitions.
[2018-07-23 15:17:19,923 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4635 transitions.
[2018-07-23 15:17:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:19,924 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:19,924 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:19,924 INFO L414 AbstractCegarLoop]: === Iteration 92 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1454971237, now seen corresponding path program 1 times
[2018-07-23 15:17:19,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:17:19,939 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:19,939 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:19,939 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:19,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:19,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:19,940 INFO L87 Difference]: Start difference. First operand 2743 states and 4635 transitions. Second operand 12 states.
[2018-07-23 15:17:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:21,999 INFO L93 Difference]: Finished difference Result 3133 states and 5275 transitions.
[2018-07-23 15:17:22,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-07-23 15:17:22,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19
[2018-07-23 15:17:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:22,003 INFO L225 Difference]: With dead ends: 3133
[2018-07-23 15:17:22,004 INFO L226 Difference]: Without dead ends: 3131
[2018-07-23 15:17:22,004 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190
[2018-07-23 15:17:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states.
[2018-07-23 15:17:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2801.
[2018-07-23 15:17:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states.
[2018-07-23 15:17:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4743 transitions.
[2018-07-23 15:17:23,583 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4743 transitions. Word has length 19
[2018-07-23 15:17:23,583 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:23,583 INFO L471 AbstractCegarLoop]: Abstraction has 2801 states and 4743 transitions.
[2018-07-23 15:17:23,583 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4743 transitions.
[2018-07-23 15:17:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:23,585 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:23,585 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:23,585 INFO L414 AbstractCegarLoop]: === Iteration 93 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1425507486, now seen corresponding path program 1 times
[2018-07-23 15:17:23,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:23,602 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:17:23,602 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:23,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:23,603 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:23,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:23,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:23,603 INFO L87 Difference]: Start difference. First operand 2801 states and 4743 transitions. Second operand 12 states.
[2018-07-23 15:17:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:25,402 INFO L93 Difference]: Finished difference Result 2901 states and 4876 transitions.
[2018-07-23 15:17:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-07-23 15:17:25,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19
[2018-07-23 15:17:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:25,404 INFO L225 Difference]: With dead ends: 2901
[2018-07-23 15:17:25,405 INFO L226 Difference]: Without dead ends: 2899
[2018-07-23 15:17:25,405 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122
[2018-07-23 15:17:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states.
[2018-07-23 15:17:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2806.
[2018-07-23 15:17:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states.
[2018-07-23 15:17:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4747 transitions.
[2018-07-23 15:17:26,968 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4747 transitions. Word has length 19
[2018-07-23 15:17:26,968 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:26,968 INFO L471 AbstractCegarLoop]: Abstraction has 2806 states and 4747 transitions.
[2018-07-23 15:17:26,968 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4747 transitions.
[2018-07-23 15:17:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-07-23 15:17:26,970 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:26,970 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:26,970 INFO L414 AbstractCegarLoop]: === Iteration 94 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1340518044, now seen corresponding path program 3 times
[2018-07-23 15:17:26,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:26,986 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:17:26,987 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:26,987 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:17:26,987 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:17:26,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:17:26,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:17:26,987 INFO L87 Difference]: Start difference. First operand 2806 states and 4747 transitions. Second operand 13 states.
[2018-07-23 15:17:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:28,755 INFO L93 Difference]: Finished difference Result 2882 states and 4840 transitions.
[2018-07-23 15:17:28,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-07-23 15:17:28,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19
[2018-07-23 15:17:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:28,758 INFO L225 Difference]: With dead ends: 2882
[2018-07-23 15:17:28,758 INFO L226 Difference]: Without dead ends: 2881
[2018-07-23 15:17:28,759 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992
[2018-07-23 15:17:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states.
[2018-07-23 15:17:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2808.
[2018-07-23 15:17:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states.
[2018-07-23 15:17:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4749 transitions.
[2018-07-23 15:17:30,354 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4749 transitions. Word has length 19
[2018-07-23 15:17:30,354 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:30,354 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 4749 transitions.
[2018-07-23 15:17:30,355 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:17:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4749 transitions.
[2018-07-23 15:17:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:17:30,357 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:30,357 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:30,357 INFO L414 AbstractCegarLoop]: === Iteration 95 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 2 times
[2018-07-23 15:17:30,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:17:30,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:30,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-07-23 15:17:30,374 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:17:30,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:17:30,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:17:30,374 INFO L87 Difference]: Start difference. First operand 2808 states and 4749 transitions. Second operand 13 states.
[2018-07-23 15:17:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:32,194 INFO L93 Difference]: Finished difference Result 2926 states and 4924 transitions.
[2018-07-23 15:17:32,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-07-23 15:17:32,194 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21
[2018-07-23 15:17:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:32,198 INFO L225 Difference]: With dead ends: 2926
[2018-07-23 15:17:32,198 INFO L226 Difference]: Without dead ends: 2924
[2018-07-23 15:17:32,199 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650
[2018-07-23 15:17:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states.
[2018-07-23 15:17:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2802.
[2018-07-23 15:17:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states.
[2018-07-23 15:17:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4737 transitions.
[2018-07-23 15:17:33,838 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4737 transitions. Word has length 21
[2018-07-23 15:17:33,838 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:33,838 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 4737 transitions.
[2018-07-23 15:17:33,838 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:17:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4737 transitions.
[2018-07-23 15:17:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:17:33,840 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:33,840 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:33,840 INFO L414 AbstractCegarLoop]: === Iteration 96 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:33,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1322152835, now seen corresponding path program 1 times
[2018-07-23 15:17:33,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:33,856 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:17:33,857 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:33,857 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:33,857 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:33,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:33,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:33,857 INFO L87 Difference]: Start difference. First operand 2802 states and 4737 transitions. Second operand 12 states.
[2018-07-23 15:17:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:35,662 INFO L93 Difference]: Finished difference Result 2956 states and 4972 transitions.
[2018-07-23 15:17:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-07-23 15:17:35,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:17:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:35,665 INFO L225 Difference]: With dead ends: 2956
[2018-07-23 15:17:35,665 INFO L226 Difference]: Without dead ends: 2954
[2018-07-23 15:17:35,666 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420
[2018-07-23 15:17:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states.
[2018-07-23 15:17:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2817.
[2018-07-23 15:17:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states.
[2018-07-23 15:17:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4761 transitions.
[2018-07-23 15:17:37,282 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4761 transitions. Word has length 21
[2018-07-23 15:17:37,282 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:37,282 INFO L471 AbstractCegarLoop]: Abstraction has 2817 states and 4761 transitions.
[2018-07-23 15:17:37,282 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4761 transitions.
[2018-07-23 15:17:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:17:37,283 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:37,283 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:37,284 INFO L414 AbstractCegarLoop]: === Iteration 97 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash 277164812, now seen corresponding path program 1 times
[2018-07-23 15:17:37,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:37,295 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:37,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:37,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:37,295 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:37,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:37,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:37,295 INFO L87 Difference]: Start difference. First operand 2817 states and 4761 transitions. Second operand 12 states.
[2018-07-23 15:17:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:39,323 INFO L93 Difference]: Finished difference Result 3140 states and 5289 transitions.
[2018-07-23 15:17:39,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-07-23 15:17:39,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:17:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:39,327 INFO L225 Difference]: With dead ends: 3140
[2018-07-23 15:17:39,327 INFO L226 Difference]: Without dead ends: 3138
[2018-07-23 15:17:39,327 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702
[2018-07-23 15:17:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states.
[2018-07-23 15:17:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2900.
[2018-07-23 15:17:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states.
[2018-07-23 15:17:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4905 transitions.
[2018-07-23 15:17:40,961 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4905 transitions. Word has length 21
[2018-07-23 15:17:40,961 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:40,961 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 4905 transitions.
[2018-07-23 15:17:40,961 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4905 transitions.
[2018-07-23 15:17:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:17:40,962 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:40,963 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:40,963 INFO L414 AbstractCegarLoop]: === Iteration 98 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:40,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2146104337, now seen corresponding path program 2 times
[2018-07-23 15:17:40,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:40,974 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:40,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:40,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:40,974 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:40,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:40,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:40,975 INFO L87 Difference]: Start difference. First operand 2900 states and 4905 transitions. Second operand 12 states.
[2018-07-23 15:17:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:43,158 INFO L93 Difference]: Finished difference Result 3107 states and 5227 transitions.
[2018-07-23 15:17:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-07-23 15:17:43,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:17:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:43,161 INFO L225 Difference]: With dead ends: 3107
[2018-07-23 15:17:43,161 INFO L226 Difference]: Without dead ends: 3105
[2018-07-23 15:17:43,162 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756
[2018-07-23 15:17:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states.
[2018-07-23 15:17:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2911.
[2018-07-23 15:17:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states.
[2018-07-23 15:17:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4924 transitions.
[2018-07-23 15:17:44,832 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4924 transitions. Word has length 21
[2018-07-23 15:17:44,832 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:44,832 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 4924 transitions.
[2018-07-23 15:17:44,832 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4924 transitions.
[2018-07-23 15:17:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:17:44,834 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:44,834 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:44,834 INFO L414 AbstractCegarLoop]: === Iteration 99 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:44,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1101116314, now seen corresponding path program 2 times
[2018-07-23 15:17:44,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:44,845 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:17:44,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:44,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:44,846 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:44,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:44,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:44,846 INFO L87 Difference]: Start difference. First operand 2911 states and 4924 transitions. Second operand 12 states.
[2018-07-23 15:17:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:46,885 INFO L93 Difference]: Finished difference Result 3164 states and 5332 transitions.
[2018-07-23 15:17:46,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-07-23 15:17:46,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:17:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:46,889 INFO L225 Difference]: With dead ends: 3164
[2018-07-23 15:17:46,889 INFO L226 Difference]: Without dead ends: 3162
[2018-07-23 15:17:46,890 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190
[2018-07-23 15:17:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states.
[2018-07-23 15:17:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2915.
[2018-07-23 15:17:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states.
[2018-07-23 15:17:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4930 transitions.
[2018-07-23 15:17:48,622 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4930 transitions. Word has length 21
[2018-07-23 15:17:48,622 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:48,622 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4930 transitions.
[2018-07-23 15:17:48,622 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4930 transitions.
[2018-07-23 15:17:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:17:48,624 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:48,624 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:17:48,624 INFO L414 AbstractCegarLoop]: === Iteration 100 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash -825971080, now seen corresponding path program 3 times
[2018-07-23 15:17:48,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:48,637 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:17:48,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:48,638 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:48,638 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:48,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:48,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:48,639 INFO L87 Difference]: Start difference. First operand 2915 states and 4930 transitions. Second operand 12 states.
[2018-07-23 15:17:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:50,786 INFO L93 Difference]: Finished difference Result 3286 states and 5534 transitions.
[2018-07-23 15:17:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-07-23 15:17:50,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:17:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:50,789 INFO L225 Difference]: With dead ends: 3286
[2018-07-23 15:17:50,790 INFO L226 Difference]: Without dead ends: 3284
[2018-07-23 15:17:50,790 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056
[2018-07-23 15:17:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states.
[2018-07-23 15:17:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2815.
[2018-07-23 15:17:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states.
[2018-07-23 15:17:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 4765 transitions.
[2018-07-23 15:17:52,460 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 4765 transitions. Word has length 21
[2018-07-23 15:17:52,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:52,460 INFO L471 AbstractCegarLoop]: Abstraction has 2815 states and 4765 transitions.
[2018-07-23 15:17:52,460 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4765 transitions.
[2018-07-23 15:17:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:17:52,462 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:52,462 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1]
[2018-07-23 15:17:52,462 INFO L414 AbstractCegarLoop]: === Iteration 101 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:52,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 3 times
[2018-07-23 15:17:52,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:17:52,476 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:52,476 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:52,476 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:52,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:52,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:52,477 INFO L87 Difference]: Start difference. First operand 2815 states and 4765 transitions. Second operand 12 states.
[2018-07-23 15:17:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:55,029 INFO L93 Difference]: Finished difference Result 3830 states and 6471 transitions.
[2018-07-23 15:17:55,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-07-23 15:17:55,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:17:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:55,033 INFO L225 Difference]: With dead ends: 3830
[2018-07-23 15:17:55,033 INFO L226 Difference]: Without dead ends: 3828
[2018-07-23 15:17:55,034 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812
[2018-07-23 15:17:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states.
[2018-07-23 15:17:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3225.
[2018-07-23 15:17:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3225 states.
[2018-07-23 15:17:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5464 transitions.
[2018-07-23 15:17:56,890 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5464 transitions. Word has length 21
[2018-07-23 15:17:56,890 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:17:56,890 INFO L471 AbstractCegarLoop]: Abstraction has 3225 states and 5464 transitions.
[2018-07-23 15:17:56,890 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:17:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5464 transitions.
[2018-07-23 15:17:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:17:56,892 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:17:56,892 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1]
[2018-07-23 15:17:56,892 INFO L414 AbstractCegarLoop]: === Iteration 102 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:17:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash -790589419, now seen corresponding path program 4 times
[2018-07-23 15:17:56,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:17:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:17:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:17:56,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:17:56,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:17:56,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:17:56,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:17:56,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:17:56,905 INFO L87 Difference]: Start difference. First operand 3225 states and 5464 transitions. Second operand 12 states.
[2018-07-23 15:17:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:17:59,597 INFO L93 Difference]: Finished difference Result 3932 states and 6616 transitions.
[2018-07-23 15:17:59,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-07-23 15:17:59,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:17:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:17:59,602 INFO L225 Difference]: With dead ends: 3932
[2018-07-23 15:17:59,602 INFO L226 Difference]: Without dead ends: 3930
[2018-07-23 15:17:59,603 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992
[2018-07-23 15:17:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states.
[2018-07-23 15:18:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3379.
[2018-07-23 15:18:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3379 states.
[2018-07-23 15:18:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 5726 transitions.
[2018-07-23 15:18:01,535 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 5726 transitions. Word has length 21
[2018-07-23 15:18:01,535 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:01,535 INFO L471 AbstractCegarLoop]: Abstraction has 3379 states and 5726 transitions.
[2018-07-23 15:18:01,535 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:18:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 5726 transitions.
[2018-07-23 15:18:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:01,536 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:01,536 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2018-07-23 15:18:01,536 INFO L414 AbstractCegarLoop]: === Iteration 103 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1656473859, now seen corresponding path program 1 times
[2018-07-23 15:18:01,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:01,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:01,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:01,551 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:18:01,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:18:01,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:18:01,551 INFO L87 Difference]: Start difference. First operand 3379 states and 5726 transitions. Second operand 12 states.
[2018-07-23 15:18:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:04,501 INFO L93 Difference]: Finished difference Result 4115 states and 6953 transitions.
[2018-07-23 15:18:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-07-23 15:18:04,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:18:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:04,505 INFO L225 Difference]: With dead ends: 4115
[2018-07-23 15:18:04,505 INFO L226 Difference]: Without dead ends: 4113
[2018-07-23 15:18:04,506 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560
[2018-07-23 15:18:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states.
[2018-07-23 15:18:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3490.
[2018-07-23 15:18:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states.
[2018-07-23 15:18:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5892 transitions.
[2018-07-23 15:18:06,552 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5892 transitions. Word has length 21
[2018-07-23 15:18:06,552 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:06,553 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5892 transitions.
[2018-07-23 15:18:06,553 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:18:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5892 transitions.
[2018-07-23 15:18:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:06,554 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:06,554 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1]
[2018-07-23 15:18:06,554 INFO L414 AbstractCegarLoop]: === Iteration 104 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1656474147, now seen corresponding path program 5 times
[2018-07-23 15:18:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:06,568 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:06,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:06,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:18:06,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:18:06,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:18:06,569 INFO L87 Difference]: Start difference. First operand 3490 states and 5892 transitions. Second operand 12 states.
[2018-07-23 15:18:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:09,640 INFO L93 Difference]: Finished difference Result 4077 states and 6809 transitions.
[2018-07-23 15:18:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-07-23 15:18:09,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:18:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:09,645 INFO L225 Difference]: With dead ends: 4077
[2018-07-23 15:18:09,645 INFO L226 Difference]: Without dead ends: 4075
[2018-07-23 15:18:09,646 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=357, Invalid=1203, Unknown=0, NotChecked=0, Total=1560
[2018-07-23 15:18:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states.
[2018-07-23 15:18:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 3523.
[2018-07-23 15:18:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states.
[2018-07-23 15:18:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5952 transitions.
[2018-07-23 15:18:11,709 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5952 transitions. Word has length 21
[2018-07-23 15:18:11,709 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:11,709 INFO L471 AbstractCegarLoop]: Abstraction has 3523 states and 5952 transitions.
[2018-07-23 15:18:11,709 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:18:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5952 transitions.
[2018-07-23 15:18:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:11,711 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:11,711 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1]
[2018-07-23 15:18:11,711 INFO L414 AbstractCegarLoop]: === Iteration 105 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1665062316, now seen corresponding path program 2 times
[2018-07-23 15:18:11,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:11,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:11,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:11,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:18:11,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:18:11,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:18:11,727 INFO L87 Difference]: Start difference. First operand 3523 states and 5952 transitions. Second operand 13 states.
[2018-07-23 15:18:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:14,936 INFO L93 Difference]: Finished difference Result 4708 states and 7968 transitions.
[2018-07-23 15:18:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-07-23 15:18:14,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21
[2018-07-23 15:18:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:14,940 INFO L225 Difference]: With dead ends: 4708
[2018-07-23 15:18:14,940 INFO L226 Difference]: Without dead ends: 4706
[2018-07-23 15:18:14,942 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406
[2018-07-23 15:18:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states.
[2018-07-23 15:18:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3926.
[2018-07-23 15:18:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3926 states.
[2018-07-23 15:18:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 6652 transitions.
[2018-07-23 15:18:17,210 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 6652 transitions. Word has length 21
[2018-07-23 15:18:17,210 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 3926 states and 6652 transitions.
[2018-07-23 15:18:17,210 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:18:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 6652 transitions.
[2018-07-23 15:18:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:17,211 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:17,211 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:18:17,211 INFO L414 AbstractCegarLoop]: === Iteration 106 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1944645353, now seen corresponding path program 1 times
[2018-07-23 15:18:17,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:17,224 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:17,224 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:17,224 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:18:17,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:18:17,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:18:17,224 INFO L87 Difference]: Start difference. First operand 3926 states and 6652 transitions. Second operand 12 states.
[2018-07-23 15:18:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:20,479 INFO L93 Difference]: Finished difference Result 4890 states and 8270 transitions.
[2018-07-23 15:18:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-07-23 15:18:20,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:18:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:20,484 INFO L225 Difference]: With dead ends: 4890
[2018-07-23 15:18:20,484 INFO L226 Difference]: Without dead ends: 4888
[2018-07-23 15:18:20,485 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870
[2018-07-23 15:18:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4888 states.
[2018-07-23 15:18:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4888 to 4312.
[2018-07-23 15:18:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4312 states.
[2018-07-23 15:18:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 7318 transitions.
[2018-07-23 15:18:22,902 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 7318 transitions. Word has length 21
[2018-07-23 15:18:22,903 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:22,903 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 7318 transitions.
[2018-07-23 15:18:22,903 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:18:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 7318 transitions.
[2018-07-23 15:18:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:22,904 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:22,904 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:18:22,904 INFO L414 AbstractCegarLoop]: === Iteration 107 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:22,904 INFO L82 PathProgramCache]: Analyzing trace with hash 502417925, now seen corresponding path program 1 times
[2018-07-23 15:18:22,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:22,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:22,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:22,921 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:18:22,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:18:22,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:18:22,922 INFO L87 Difference]: Start difference. First operand 4312 states and 7318 transitions. Second operand 12 states.
[2018-07-23 15:18:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:26,573 INFO L93 Difference]: Finished difference Result 5047 states and 8540 transitions.
[2018-07-23 15:18:26,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-07-23 15:18:26,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:18:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:26,579 INFO L225 Difference]: With dead ends: 5047
[2018-07-23 15:18:26,579 INFO L226 Difference]: Without dead ends: 5045
[2018-07-23 15:18:26,581 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870
[2018-07-23 15:18:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5045 states.
[2018-07-23 15:18:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5045 to 4470.
[2018-07-23 15:18:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states.
[2018-07-23 15:18:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 7567 transitions.
[2018-07-23 15:18:29,308 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 7567 transitions. Word has length 21
[2018-07-23 15:18:29,308 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:29,308 INFO L471 AbstractCegarLoop]: Abstraction has 4470 states and 7567 transitions.
[2018-07-23 15:18:29,308 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:18:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 7567 transitions.
[2018-07-23 15:18:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:29,309 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:29,309 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:18:29,309 INFO L414 AbstractCegarLoop]: === Iteration 108 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash 502418213, now seen corresponding path program 2 times
[2018-07-23 15:18:29,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:29,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:29,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:29,325 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:18:29,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:18:29,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:18:29,325 INFO L87 Difference]: Start difference. First operand 4470 states and 7567 transitions. Second operand 12 states.
[2018-07-23 15:18:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:32,832 INFO L93 Difference]: Finished difference Result 5152 states and 8677 transitions.
[2018-07-23 15:18:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-07-23 15:18:32,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:18:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:32,837 INFO L225 Difference]: With dead ends: 5152
[2018-07-23 15:18:32,837 INFO L226 Difference]: Without dead ends: 5150
[2018-07-23 15:18:32,837 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190
[2018-07-23 15:18:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states.
[2018-07-23 15:18:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 4477.
[2018-07-23 15:18:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4477 states.
[2018-07-23 15:18:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 7584 transitions.
[2018-07-23 15:18:35,378 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 7584 transitions. Word has length 21
[2018-07-23 15:18:35,378 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:35,378 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 7584 transitions.
[2018-07-23 15:18:35,378 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:18:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 7584 transitions.
[2018-07-23 15:18:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:35,380 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:35,380 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:18:35,380 INFO L414 AbstractCegarLoop]: === Iteration 109 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 511006382, now seen corresponding path program 2 times
[2018-07-23 15:18:35,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:35,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:35,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:35,391 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-07-23 15:18:35,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-07-23 15:18:35,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2018-07-23 15:18:35,391 INFO L87 Difference]: Start difference. First operand 4477 states and 7584 transitions. Second operand 13 states.
[2018-07-23 15:18:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:39,025 INFO L93 Difference]: Finished difference Result 5562 states and 9455 transitions.
[2018-07-23 15:18:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-07-23 15:18:39,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21
[2018-07-23 15:18:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:39,031 INFO L225 Difference]: With dead ends: 5562
[2018-07-23 15:18:39,031 INFO L226 Difference]: Without dead ends: 5560
[2018-07-23 15:18:39,033 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812
[2018-07-23 15:18:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states.
[2018-07-23 15:18:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 4895.
[2018-07-23 15:18:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states.
[2018-07-23 15:18:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 8338 transitions.
[2018-07-23 15:18:41,869 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 8338 transitions. Word has length 21
[2018-07-23 15:18:41,870 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:41,870 INFO L471 AbstractCegarLoop]: Abstraction has 4895 states and 8338 transitions.
[2018-07-23 15:18:41,870 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-07-23 15:18:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 8338 transitions.
[2018-07-23 15:18:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:41,871 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:41,871 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:18:41,871 INFO L414 AbstractCegarLoop]: === Iteration 110 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:41,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1892744866, now seen corresponding path program 1 times
[2018-07-23 15:18:41,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:41,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:41,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:41,886 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:18:41,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:18:41,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:18:41,886 INFO L87 Difference]: Start difference. First operand 4895 states and 8338 transitions. Second operand 12 states.
[2018-07-23 15:18:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:45,664 INFO L93 Difference]: Finished difference Result 5795 states and 9885 transitions.
[2018-07-23 15:18:45,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-07-23 15:18:45,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:18:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:45,669 INFO L225 Difference]: With dead ends: 5795
[2018-07-23 15:18:45,669 INFO L226 Difference]: Without dead ends: 5793
[2018-07-23 15:18:45,670 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756
[2018-07-23 15:18:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states.
[2018-07-23 15:18:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5351.
[2018-07-23 15:18:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5351 states.
[2018-07-23 15:18:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 9168 transitions.
[2018-07-23 15:18:48,799 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 9168 transitions. Word has length 21
[2018-07-23 15:18:48,799 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 5351 states and 9168 transitions.
[2018-07-23 15:18:48,799 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:18:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 9168 transitions.
[2018-07-23 15:18:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:48,801 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:48,801 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-07-23 15:18:48,801 INFO L414 AbstractCegarLoop]: === Iteration 111 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:48,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1195981155, now seen corresponding path program 3 times
[2018-07-23 15:18:48,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:18:48,816 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:48,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:18:48,817 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:18:48,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:18:48,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:18:48,817 INFO L87 Difference]: Start difference. First operand 5351 states and 9168 transitions. Second operand 12 states.
[2018-07-23 15:18:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:18:53,185 INFO L93 Difference]: Finished difference Result 6216 states and 10633 transitions.
[2018-07-23 15:18:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-07-23 15:18:53,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:18:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:18:53,192 INFO L225 Difference]: With dead ends: 6216
[2018-07-23 15:18:53,193 INFO L226 Difference]: Without dead ends: 6214
[2018-07-23 15:18:53,194 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930
[2018-07-23 15:18:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states.
[2018-07-23 15:18:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5792.
[2018-07-23 15:18:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5792 states.
[2018-07-23 15:18:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5792 states to 5792 states and 9945 transitions.
[2018-07-23 15:18:56,629 INFO L78 Accepts]: Start accepts. Automaton has 5792 states and 9945 transitions. Word has length 21
[2018-07-23 15:18:56,629 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:18:56,629 INFO L471 AbstractCegarLoop]: Abstraction has 5792 states and 9945 transitions.
[2018-07-23 15:18:56,629 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:18:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5792 states and 9945 transitions.
[2018-07-23 15:18:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:18:56,631 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:18:56,631 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 15:18:56,631 INFO L414 AbstractCegarLoop]: === Iteration 112 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:18:56,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1244712345, now seen corresponding path program 1 times
[2018-07-23 15:18:56,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:18:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:18:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-07-23 15:18:56,644 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:18:56,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:18:56,645 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:18:56,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:18:56,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:18:56,645 INFO L87 Difference]: Start difference. First operand 5792 states and 9945 transitions. Second operand 12 states.
[2018-07-23 15:19:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:19:01,521 INFO L93 Difference]: Finished difference Result 6775 states and 11608 transitions.
[2018-07-23 15:19:01,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-07-23 15:19:01,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:19:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:19:01,528 INFO L225 Difference]: With dead ends: 6775
[2018-07-23 15:19:01,529 INFO L226 Difference]: Without dead ends: 6773
[2018-07-23 15:19:01,530 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=408, Invalid=1232, Unknown=0, NotChecked=0, Total=1640
[2018-07-23 15:19:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states.
[2018-07-23 15:19:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 5546.
[2018-07-23 15:19:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5546 states.
[2018-07-23 15:19:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 9498 transitions.
[2018-07-23 15:19:05,035 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 9498 transitions. Word has length 21
[2018-07-23 15:19:05,035 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:19:05,035 INFO L471 AbstractCegarLoop]: Abstraction has 5546 states and 9498 transitions.
[2018-07-23 15:19:05,035 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:19:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 9498 transitions.
[2018-07-23 15:19:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:19:05,037 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:19:05,037 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1]
[2018-07-23 15:19:05,037 INFO L414 AbstractCegarLoop]: === Iteration 113 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:19:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2122062335, now seen corresponding path program 6 times
[2018-07-23 15:19:05,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:19:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:19:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:19:05,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:19:05,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:19:05,053 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:19:05,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:19:05,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:19:05,053 INFO L87 Difference]: Start difference. First operand 5546 states and 9498 transitions. Second operand 12 states.
[2018-07-23 15:19:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:19:10,834 INFO L93 Difference]: Finished difference Result 7993 states and 13790 transitions.
[2018-07-23 15:19:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-07-23 15:19:10,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:19:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:19:10,844 INFO L225 Difference]: With dead ends: 7993
[2018-07-23 15:19:10,844 INFO L226 Difference]: Without dead ends: 7991
[2018-07-23 15:19:10,846 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812
[2018-07-23 15:19:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7991 states.
[2018-07-23 15:19:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7991 to 6894.
[2018-07-23 15:19:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states.
[2018-07-23 15:19:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11875 transitions.
[2018-07-23 15:19:15,130 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11875 transitions. Word has length 21
[2018-07-23 15:19:15,130 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:19:15,130 INFO L471 AbstractCegarLoop]: Abstraction has 6894 states and 11875 transitions.
[2018-07-23 15:19:15,130 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:19:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11875 transitions.
[2018-07-23 15:19:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:19:15,132 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:19:15,132 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2018-07-23 15:19:15,132 INFO L414 AbstractCegarLoop]: === Iteration 114 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:19:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 274158317, now seen corresponding path program 3 times
[2018-07-23 15:19:15,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:19:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:19:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:19:15,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:19:15,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:19:15,145 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:19:15,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:19:15,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:19:15,146 INFO L87 Difference]: Start difference. First operand 6894 states and 11875 transitions. Second operand 12 states.
[2018-07-23 15:19:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:19:21,923 INFO L93 Difference]: Finished difference Result 8437 states and 14562 transitions.
[2018-07-23 15:19:21,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-07-23 15:19:21,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:19:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:19:21,932 INFO L225 Difference]: With dead ends: 8437
[2018-07-23 15:19:21,932 INFO L226 Difference]: Without dead ends: 8435
[2018-07-23 15:19:21,934 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812
[2018-07-23 15:19:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8435 states.
[2018-07-23 15:19:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8435 to 7260.
[2018-07-23 15:19:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states.
[2018-07-23 15:19:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 12485 transitions.
[2018-07-23 15:19:26,539 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 12485 transitions. Word has length 21
[2018-07-23 15:19:26,539 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:19:26,539 INFO L471 AbstractCegarLoop]: Abstraction has 7260 states and 12485 transitions.
[2018-07-23 15:19:26,539 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:19:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 12485 transitions.
[2018-07-23 15:19:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:19:26,541 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:19:26,541 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1]
[2018-07-23 15:19:26,541 INFO L414 AbstractCegarLoop]: === Iteration 115 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:19:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash 274158605, now seen corresponding path program 7 times
[2018-07-23 15:19:26,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:19:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:19:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:19:26,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:19:26,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:19:26,554 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:19:26,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:19:26,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:19:26,555 INFO L87 Difference]: Start difference. First operand 7260 states and 12485 transitions. Second operand 12 states.
[2018-07-23 15:19:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:19:33,304 INFO L93 Difference]: Finished difference Result 8575 states and 14718 transitions.
[2018-07-23 15:19:33,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-07-23 15:19:33,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:19:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:19:33,317 INFO L225 Difference]: With dead ends: 8575
[2018-07-23 15:19:33,317 INFO L226 Difference]: Without dead ends: 8573
[2018-07-23 15:19:33,320 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056
[2018-07-23 15:19:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8573 states.
[2018-07-23 15:19:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8573 to 7185.
[2018-07-23 15:19:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7185 states.
[2018-07-23 15:19:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 12367 transitions.
[2018-07-23 15:19:37,917 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 12367 transitions. Word has length 21
[2018-07-23 15:19:37,917 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:19:37,917 INFO L471 AbstractCegarLoop]: Abstraction has 7185 states and 12367 transitions.
[2018-07-23 15:19:37,918 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:19:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 12367 transitions.
[2018-07-23 15:19:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:19:37,919 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:19:37,919 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1]
[2018-07-23 15:19:37,919 INFO L414 AbstractCegarLoop]: === Iteration 116 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:19:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 282746774, now seen corresponding path program 4 times
[2018-07-23 15:19:37,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:19:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:19:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 15:19:37,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:19:37,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-07-23 15:19:37,933 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:19:37,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:19:37,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:19:37,933 INFO L87 Difference]: Start difference. First operand 7185 states and 12367 transitions. Second operand 12 states.
[2018-07-23 15:19:38,263 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15
[2018-07-23 15:19:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 15:19:44,556 INFO L93 Difference]: Finished difference Result 9004 states and 15545 transitions.
[2018-07-23 15:19:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-07-23 15:19:44,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21
[2018-07-23 15:19:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 15:19:44,566 INFO L225 Difference]: With dead ends: 9004
[2018-07-23 15:19:44,566 INFO L226 Difference]: Without dead ends: 9002
[2018-07-23 15:19:44,569 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122
[2018-07-23 15:19:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9002 states.
[2018-07-23 15:19:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9002 to 8158.
[2018-07-23 15:19:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8158 states.
[2018-07-23 15:19:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 14063 transitions.
[2018-07-23 15:19:49,640 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 14063 transitions. Word has length 21
[2018-07-23 15:19:49,640 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-07-23 15:19:49,640 INFO L471 AbstractCegarLoop]: Abstraction has 8158 states and 14063 transitions.
[2018-07-23 15:19:49,640 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-07-23 15:19:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 14063 transitions.
[2018-07-23 15:19:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-07-23 15:19:49,642 INFO L345 BasicCegarLoop]: Found error trace
[2018-07-23 15:19:49,642 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:19:49,642 INFO L414 AbstractCegarLoop]: === Iteration 117 === [productErr3AssertViolationASSERT, productErr0AssertViolationASSERT, productErr1AssertViolationASSERT, productErr2AssertViolationASSERT]===
[2018-07-23 15:19:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2121004474, now seen corresponding path program 1 times
[2018-07-23 15:19:49,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-07-23 15:19:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 15:19:49,655 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:19:49,656 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-07-23 15:19:49,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2018-07-23 15:19:49,656 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-07-23 15:19:49,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-07-23 15:19:49,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2018-07-23 15:19:49,657 INFO L87 Difference]: Start difference. First operand 8158 states and 14063 transitions. Second operand 12 states.
Received shutdown request...
[2018-07-23 15:19:54,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-07-23 15:19:54,373 WARN L540 AbstractCegarLoop]: Verification canceled
[2018-07-23 15:19:54,380 WARN L202 ceAbstractionStarter]: Timeout
[2018-07-23 15:19:54,381 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:19:54 BoogieIcfgContainer
[2018-07-23 15:19:54,381 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-07-23 15:19:54,382 INFO L168 Benchmark]: Toolchain (without parser) took 255847.78 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 948.7 MB in the end (delta: 493.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB.
[2018-07-23 15:19:54,383 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-07-23 15:19:54,384 INFO L168 Benchmark]: Boogie Preprocessor took 55.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-07-23 15:19:54,384 INFO L168 Benchmark]: RCFGBuilder took 252.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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:54,384 INFO L168 Benchmark]: TraceAbstraction took 255535.98 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 948.7 MB in the end (delta: 482.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB.
[2018-07-23 15:19:54,388 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Preprocessor took 55.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
* RCFGBuilder took 252.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 255535.98 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 948.7 MB in the end (delta: 482.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and interpolant automaton (currently 30 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6024 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and interpolant automaton (currently 30 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6024 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and interpolant automaton (currently 30 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6024 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (8158states) and interpolant automaton (currently 30 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (6024 states constructedinput type IntersectNwa).
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 255.4s OverallTime, 117 OverallIterations, 4 TraceHistogramMax, 149.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4270 SDtfs, 11030 SDslu, 9331 SDs, 0 SdLazy, 62471 SolverSat, 5469 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2589 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12556 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8158occurred in iteration=116, 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: 103.1s AutomataMinimizationTime, 116 MinimizatonAttempts, 24449 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1792 NumberOfCodeBlocks, 1792 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 1675 ConstructedInterpolants, 0 QuantifiedInterpolants, 172780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 117 InterpolantComputations, 7 PerfectInterpolantSequences, 135/1170 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_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-19-54-408.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-19-54-408.csv
Completed graceful shutdown