java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:36:09,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:36:09,491 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:36:09,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:36:09,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:36:09,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:36:09,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:36:09,508 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:36:09,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:36:09,510 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:36:09,511 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:36:09,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:36:09,512 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:36:09,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:36:09,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:36:09,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:36:09,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:36:09,518 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:36:09,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:36:09,521 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:36:09,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:36:09,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:36:09,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:36:09,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:36:09,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:36:09,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:36:09,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:36:09,529 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:36:09,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:36:09,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:36:09,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:36:09,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:36:09,533 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:36:09,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:36:09,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:36:09,535 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:36:09,535 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:36:09,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:36:09,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:36:09,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:36:09,553 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:36:09,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:36:09,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:36:09,553 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:36:09,553 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:36:09,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:36:09,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:36:09,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:36:09,634 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:36:09,635 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:36:09,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-07-25 08:36:09,636 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-07-25 08:36:09,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:36:09,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:36:09,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:09,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:36:09,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:36:09,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,782 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:36:09,782 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:36:09,782 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:36:09,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:09,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:36:09,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:36:09,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:36:09,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:36:09,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:36:09,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:36:09,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:36:09,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/1) ... [2018-07-25 08:36:09,946 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 08:36:09,947 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 08:36:09,947 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 08:36:10,262 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:36:10,263 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:10 BoogieIcfgContainer [2018-07-25 08:36:10,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:36:10,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:36:10,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:36:10,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:36:10,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:09" (1/2) ... [2018-07-25 08:36:10,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ec5c50 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:36:10, skipping insertion in model container [2018-07-25 08:36:10,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:10" (2/2) ... [2018-07-25 08:36:10,272 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-07-25 08:36:10,285 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:36:10,293 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-07-25 08:36:10,332 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:36:10,333 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:36:10,333 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:36:10,333 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:36:10,333 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:36:10,333 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:36:10,334 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:36:10,334 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:36:10,334 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:36:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-07-25 08:36:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:36:10,360 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:10,361 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:10,363 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-07-25 08:36:10,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:10,495 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-25 08:36:10,498 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:10,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:10,503 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:10,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:10,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:10,521 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-07-25 08:36:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:11,154 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-07-25 08:36:11,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:36:11,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-07-25 08:36:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:11,189 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:36:11,190 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 08:36:11,194 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 08:36:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-07-25 08:36:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:36:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-07-25 08:36:11,258 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-07-25 08:36:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:11,259 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-07-25 08:36:11,259 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-07-25 08:36:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:36:11,261 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:11,261 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:11,262 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-07-25 08:36:11,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:11,285 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-25 08:36:11,286 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:11,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:11,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:36:11,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:36:11,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:11,289 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-07-25 08:36:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:11,616 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-07-25 08:36:11,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:36:11,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-07-25 08:36:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:11,623 INFO L225 Difference]: With dead ends: 188 [2018-07-25 08:36:11,624 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:36:11,627 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:36:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-07-25 08:36:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 08:36:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-07-25 08:36:11,677 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-07-25 08:36:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:11,677 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-07-25 08:36:11,677 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:36:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-07-25 08:36:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:11,679 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:11,679 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:11,682 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-07-25 08:36:11,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:11,724 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-25 08:36:11,726 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:11,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:11,727 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:11,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:11,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:11,728 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-07-25 08:36:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:12,107 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-07-25 08:36:12,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:12,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-07-25 08:36:12,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:12,116 INFO L225 Difference]: With dead ends: 361 [2018-07-25 08:36:12,116 INFO L226 Difference]: Without dead ends: 349 [2018-07-25 08:36:12,118 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:36:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-07-25 08:36:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-07-25 08:36:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 08:36:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-07-25 08:36:12,179 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-07-25 08:36:12,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:12,180 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-07-25 08:36:12,180 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-07-25 08:36:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:12,184 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:12,185 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:12,186 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:12,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-07-25 08:36:12,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:12,207 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-25 08:36:12,207 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:12,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:12,208 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:12,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:12,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:12,209 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-07-25 08:36:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:12,508 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-07-25 08:36:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:12,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-07-25 08:36:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:12,512 INFO L225 Difference]: With dead ends: 307 [2018-07-25 08:36:12,512 INFO L226 Difference]: Without dead ends: 302 [2018-07-25 08:36:12,513 INFO L574 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-25 08:36:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-25 08:36:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-07-25 08:36:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 08:36:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-07-25 08:36:12,571 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-07-25 08:36:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:12,571 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-07-25 08:36:12,571 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-07-25 08:36:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:12,577 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:12,578 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:12,579 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:12,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-07-25 08:36:12,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:12,617 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-25 08:36:12,617 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:12,617 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:12,618 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:12,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:12,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:12,619 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-07-25 08:36:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:13,472 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-07-25 08:36:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:36:13,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:13,479 INFO L225 Difference]: With dead ends: 741 [2018-07-25 08:36:13,479 INFO L226 Difference]: Without dead ends: 733 [2018-07-25 08:36:13,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:36:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-07-25 08:36:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-07-25 08:36:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-07-25 08:36:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-07-25 08:36:13,584 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-07-25 08:36:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:13,584 INFO L472 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-07-25 08:36:13,584 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-07-25 08:36:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:13,590 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:13,595 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:13,596 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:13,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-07-25 08:36:13,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:13,618 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-25 08:36:13,619 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:13,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:13,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:13,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:13,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:13,620 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-07-25 08:36:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:14,427 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-07-25 08:36:14,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:36:14,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:14,436 INFO L225 Difference]: With dead ends: 797 [2018-07-25 08:36:14,436 INFO L226 Difference]: Without dead ends: 789 [2018-07-25 08:36:14,438 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:36:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-07-25 08:36:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-07-25 08:36:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-07-25 08:36:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-07-25 08:36:14,544 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-07-25 08:36:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:14,544 INFO L472 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-07-25 08:36:14,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-07-25 08:36:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:14,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:14,547 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:14,547 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:14,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-07-25 08:36:14,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:14,581 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-25 08:36:14,582 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:14,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:14,582 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:14,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:14,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:14,583 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-07-25 08:36:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:15,383 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-07-25 08:36:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:36:15,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:15,389 INFO L225 Difference]: With dead ends: 684 [2018-07-25 08:36:15,390 INFO L226 Difference]: Without dead ends: 676 [2018-07-25 08:36:15,392 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:36:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-07-25 08:36:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-07-25 08:36:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-07-25 08:36:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-07-25 08:36:15,493 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-07-25 08:36:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:15,493 INFO L472 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-07-25 08:36:15,494 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-07-25 08:36:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:15,497 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:15,497 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:15,498 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-07-25 08:36:15,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:15,519 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-25 08:36:15,520 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:15,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:15,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:15,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:15,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:15,522 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-07-25 08:36:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:16,147 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-07-25 08:36:16,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:36:16,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:16,151 INFO L225 Difference]: With dead ends: 605 [2018-07-25 08:36:16,152 INFO L226 Difference]: Without dead ends: 597 [2018-07-25 08:36:16,153 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-07-25 08:36:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-07-25 08:36:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-25 08:36:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-07-25 08:36:16,257 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-07-25 08:36:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:16,258 INFO L472 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-07-25 08:36:16,258 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-07-25 08:36:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:16,259 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:16,259 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:16,260 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-07-25 08:36:16,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:16,273 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-25 08:36:16,273 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:16,273 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:16,274 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:16,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:16,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:16,275 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-07-25 08:36:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:17,173 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-07-25 08:36:17,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:36:17,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:17,180 INFO L225 Difference]: With dead ends: 935 [2018-07-25 08:36:17,180 INFO L226 Difference]: Without dead ends: 927 [2018-07-25 08:36:17,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:36:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-07-25 08:36:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-07-25 08:36:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-07-25 08:36:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-07-25 08:36:17,311 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-07-25 08:36:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:17,311 INFO L472 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-07-25 08:36:17,311 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-07-25 08:36:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:17,312 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:17,313 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:17,313 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-07-25 08:36:17,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:17,329 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-25 08:36:17,329 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:17,330 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:17,330 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:17,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:17,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:17,331 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-07-25 08:36:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:18,237 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-07-25 08:36:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:36:18,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:18,245 INFO L225 Difference]: With dead ends: 923 [2018-07-25 08:36:18,245 INFO L226 Difference]: Without dead ends: 915 [2018-07-25 08:36:18,247 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:36:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-07-25 08:36:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-07-25 08:36:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-07-25 08:36:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-07-25 08:36:18,401 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-07-25 08:36:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:18,401 INFO L472 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-07-25 08:36:18,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-07-25 08:36:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:18,404 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:18,404 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:18,405 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:18,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-07-25 08:36:18,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:18,425 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-25 08:36:18,426 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:18,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:18,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:18,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:18,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:18,427 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-07-25 08:36:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:19,239 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-07-25 08:36:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:36:19,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:19,244 INFO L225 Difference]: With dead ends: 837 [2018-07-25 08:36:19,245 INFO L226 Difference]: Without dead ends: 829 [2018-07-25 08:36:19,246 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-07-25 08:36:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-07-25 08:36:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 08:36:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-07-25 08:36:19,384 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-07-25 08:36:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:19,385 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-07-25 08:36:19,385 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-07-25 08:36:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:19,386 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:19,386 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:19,387 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:19,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-07-25 08:36:19,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:19,398 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-25 08:36:19,399 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:19,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:19,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:19,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:19,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:19,400 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-07-25 08:36:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:20,353 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-07-25 08:36:20,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:36:20,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:20,360 INFO L225 Difference]: With dead ends: 996 [2018-07-25 08:36:20,360 INFO L226 Difference]: Without dead ends: 988 [2018-07-25 08:36:20,362 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:36:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-07-25 08:36:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-07-25 08:36:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-25 08:36:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-07-25 08:36:20,539 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-07-25 08:36:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:20,541 INFO L472 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-07-25 08:36:20,541 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-07-25 08:36:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:20,542 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:20,542 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:20,543 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:20,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-07-25 08:36:20,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:20,556 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-25 08:36:20,556 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:20,556 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:20,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:20,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:20,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:20,557 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-07-25 08:36:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:21,480 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-07-25 08:36:21,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:36:21,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:21,487 INFO L225 Difference]: With dead ends: 913 [2018-07-25 08:36:21,487 INFO L226 Difference]: Without dead ends: 905 [2018-07-25 08:36:21,488 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:36:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-07-25 08:36:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-07-25 08:36:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-07-25 08:36:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-07-25 08:36:21,674 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-07-25 08:36:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:21,674 INFO L472 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-07-25 08:36:21,674 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-07-25 08:36:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:21,675 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:21,676 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:21,676 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:21,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-07-25 08:36:21,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:21,687 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-25 08:36:21,690 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:21,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:21,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:21,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:21,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:21,691 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-07-25 08:36:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:22,571 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-07-25 08:36:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:36:22,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:36:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:22,578 INFO L225 Difference]: With dead ends: 886 [2018-07-25 08:36:22,579 INFO L226 Difference]: Without dead ends: 878 [2018-07-25 08:36:22,580 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:36:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-07-25 08:36:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-07-25 08:36:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-07-25 08:36:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-07-25 08:36:22,841 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-07-25 08:36:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:22,842 INFO L472 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-07-25 08:36:22,842 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-07-25 08:36:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:22,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:22,844 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:22,844 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-07-25 08:36:22,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:22,884 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-25 08:36:22,884 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:22,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:22,885 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:22,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:22,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:22,887 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-07-25 08:36:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:23,904 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-07-25 08:36:23,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:36:23,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:23,909 INFO L225 Difference]: With dead ends: 801 [2018-07-25 08:36:23,909 INFO L226 Difference]: Without dead ends: 793 [2018-07-25 08:36:23,913 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:36:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-07-25 08:36:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-07-25 08:36:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-07-25 08:36:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-07-25 08:36:24,173 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-07-25 08:36:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:24,173 INFO L472 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-07-25 08:36:24,173 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-07-25 08:36:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:24,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:24,175 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:24,175 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-07-25 08:36:24,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:24,193 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-25 08:36:24,193 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:24,194 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:24,194 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:24,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:24,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:24,197 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-07-25 08:36:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:25,425 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-07-25 08:36:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:36:25,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:25,432 INFO L225 Difference]: With dead ends: 962 [2018-07-25 08:36:25,433 INFO L226 Difference]: Without dead ends: 954 [2018-07-25 08:36:25,434 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:36:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-07-25 08:36:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-07-25 08:36:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-07-25 08:36:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-07-25 08:36:25,684 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-07-25 08:36:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:25,684 INFO L472 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-07-25 08:36:25,685 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-07-25 08:36:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:25,686 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:25,686 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:25,686 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:25,687 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-07-25 08:36:25,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:25,702 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-25 08:36:25,702 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:25,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:25,703 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:25,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:25,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:25,703 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-07-25 08:36:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:27,007 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-07-25 08:36:27,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:36:27,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:27,014 INFO L225 Difference]: With dead ends: 1000 [2018-07-25 08:36:27,014 INFO L226 Difference]: Without dead ends: 992 [2018-07-25 08:36:27,019 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:36:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-07-25 08:36:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-07-25 08:36:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-07-25 08:36:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-07-25 08:36:27,434 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-07-25 08:36:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:27,434 INFO L472 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-07-25 08:36:27,434 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-07-25 08:36:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:27,435 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:27,436 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:27,436 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-07-25 08:36:27,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:27,449 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-25 08:36:27,449 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:27,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:27,450 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:27,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:27,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:27,451 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-07-25 08:36:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:28,858 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-07-25 08:36:28,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:36:28,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:28,866 INFO L225 Difference]: With dead ends: 1065 [2018-07-25 08:36:28,866 INFO L226 Difference]: Without dead ends: 1057 [2018-07-25 08:36:28,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:36:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-07-25 08:36:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-07-25 08:36:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-07-25 08:36:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-07-25 08:36:29,224 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-07-25 08:36:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:29,224 INFO L472 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-07-25 08:36:29,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-07-25 08:36:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:29,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:29,225 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:29,226 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:29,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-07-25 08:36:29,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:29,242 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-25 08:36:29,243 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:29,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:29,243 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:29,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:29,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:29,244 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-07-25 08:36:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:30,942 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-07-25 08:36:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:36:30,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:30,950 INFO L225 Difference]: With dead ends: 1227 [2018-07-25 08:36:30,950 INFO L226 Difference]: Without dead ends: 1219 [2018-07-25 08:36:30,951 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:36:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-07-25 08:36:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-07-25 08:36:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-07-25 08:36:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-07-25 08:36:31,323 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-07-25 08:36:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:31,323 INFO L472 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-07-25 08:36:31,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-07-25 08:36:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:31,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:31,325 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:31,325 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:31,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-07-25 08:36:31,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:31,342 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-25 08:36:31,342 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:31,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:31,343 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:31,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:31,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:31,343 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-07-25 08:36:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:32,824 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-07-25 08:36:32,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:36:32,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:32,830 INFO L225 Difference]: With dead ends: 1076 [2018-07-25 08:36:32,830 INFO L226 Difference]: Without dead ends: 1068 [2018-07-25 08:36:32,831 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:36:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-07-25 08:36:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-07-25 08:36:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-07-25 08:36:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-07-25 08:36:33,138 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-07-25 08:36:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:33,139 INFO L472 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-07-25 08:36:33,139 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-07-25 08:36:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:33,140 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:33,140 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:33,140 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:33,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-07-25 08:36:33,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:33,150 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-25 08:36:33,150 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:33,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:33,151 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:33,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:33,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:33,151 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-07-25 08:36:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:34,359 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-07-25 08:36:34,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:34,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:34,365 INFO L225 Difference]: With dead ends: 1111 [2018-07-25 08:36:34,365 INFO L226 Difference]: Without dead ends: 1103 [2018-07-25 08:36:34,366 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-07-25 08:36:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-07-25 08:36:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-07-25 08:36:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-07-25 08:36:34,843 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-07-25 08:36:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:34,843 INFO L472 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-07-25 08:36:34,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-07-25 08:36:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:34,844 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:34,844 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:34,845 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:34,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-07-25 08:36:34,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:34,863 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-25 08:36:34,864 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:34,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:34,864 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:34,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:34,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:34,865 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-07-25 08:36:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:36,270 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-07-25 08:36:36,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:36:36,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:36,277 INFO L225 Difference]: With dead ends: 1304 [2018-07-25 08:36:36,277 INFO L226 Difference]: Without dead ends: 1296 [2018-07-25 08:36:36,278 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:36:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-07-25 08:36:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-07-25 08:36:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-07-25 08:36:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-07-25 08:36:36,666 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-07-25 08:36:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:36,667 INFO L472 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-07-25 08:36:36,667 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-07-25 08:36:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:36,668 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:36,668 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:36,668 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:36,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-07-25 08:36:36,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:36,682 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-25 08:36:36,682 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:36,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:36,683 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:36,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:36,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:36,685 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-07-25 08:36:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:38,171 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-07-25 08:36:38,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:36:38,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:38,179 INFO L225 Difference]: With dead ends: 1370 [2018-07-25 08:36:38,179 INFO L226 Difference]: Without dead ends: 1362 [2018-07-25 08:36:38,180 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:36:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-07-25 08:36:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-07-25 08:36:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-07-25 08:36:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-07-25 08:36:38,556 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-07-25 08:36:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:38,557 INFO L472 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-07-25 08:36:38,557 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-07-25 08:36:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:38,558 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:38,558 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:38,558 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:38,559 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-07-25 08:36:38,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:38,566 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-25 08:36:38,567 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:38,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:38,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:38,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:38,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:38,568 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-07-25 08:36:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:39,790 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-07-25 08:36:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:36:39,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:39,797 INFO L225 Difference]: With dead ends: 1298 [2018-07-25 08:36:39,798 INFO L226 Difference]: Without dead ends: 1290 [2018-07-25 08:36:39,799 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:36:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-07-25 08:36:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-07-25 08:36:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-07-25 08:36:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-07-25 08:36:40,278 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-07-25 08:36:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:40,278 INFO L472 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-07-25 08:36:40,278 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-07-25 08:36:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:40,279 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:40,279 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:40,279 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:40,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-07-25 08:36:40,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:40,286 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:40,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:40,286 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:40,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:40,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:40,287 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-07-25 08:36:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:40,829 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-07-25 08:36:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:36:40,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-07-25 08:36:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:40,832 INFO L225 Difference]: With dead ends: 1242 [2018-07-25 08:36:40,832 INFO L226 Difference]: Without dead ends: 673 [2018-07-25 08:36:40,834 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-07-25 08:36:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-07-25 08:36:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-07-25 08:36:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-07-25 08:36:41,381 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-07-25 08:36:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:41,382 INFO L472 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-07-25 08:36:41,382 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-07-25 08:36:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:41,383 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:41,383 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:41,383 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-07-25 08:36:41,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:41,408 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-25 08:36:41,409 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:41,409 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:41,409 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:41,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:41,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:41,410 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 9 states. [2018-07-25 08:36:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:42,478 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-07-25 08:36:42,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:42,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:42,481 INFO L225 Difference]: With dead ends: 854 [2018-07-25 08:36:42,481 INFO L226 Difference]: Without dead ends: 849 [2018-07-25 08:36:42,482 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-07-25 08:36:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-07-25 08:36:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-07-25 08:36:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-07-25 08:36:43,096 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-07-25 08:36:43,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:43,097 INFO L472 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-07-25 08:36:43,097 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-07-25 08:36:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:43,098 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:43,098 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:43,098 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:43,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-07-25 08:36:43,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:43,104 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:43,105 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:36:43,105 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:43,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:43,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:43,105 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-07-25 08:36:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:44,009 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-07-25 08:36:44,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:36:44,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-07-25 08:36:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:44,011 INFO L225 Difference]: With dead ends: 1308 [2018-07-25 08:36:44,012 INFO L226 Difference]: Without dead ends: 709 [2018-07-25 08:36:44,013 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-07-25 08:36:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-07-25 08:36:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-07-25 08:36:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-07-25 08:36:45,109 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-07-25 08:36:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:45,110 INFO L472 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-07-25 08:36:45,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-07-25 08:36:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:45,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:45,111 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:45,111 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-07-25 08:36:45,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:45,126 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-25 08:36:45,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:45,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:45,129 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:45,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:45,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:45,129 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 9 states. [2018-07-25 08:36:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:46,711 INFO L93 Difference]: Finished difference Result 979 states and 2143 transitions. [2018-07-25 08:36:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:36:46,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:36:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:46,715 INFO L225 Difference]: With dead ends: 979 [2018-07-25 08:36:46,715 INFO L226 Difference]: Without dead ends: 971 [2018-07-25 08:36:46,716 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:36:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-07-25 08:36:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 725. [2018-07-25 08:36:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-07-25 08:36:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1649 transitions. [2018-07-25 08:36:47,401 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1649 transitions. Word has length 16 [2018-07-25 08:36:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:47,402 INFO L472 AbstractCegarLoop]: Abstraction has 725 states and 1649 transitions. [2018-07-25 08:36:47,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1649 transitions. [2018-07-25 08:36:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:47,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:47,403 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:47,403 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-07-25 08:36:47,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:47,414 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-25 08:36:47,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:47,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:47,414 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:47,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:47,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:47,415 INFO L87 Difference]: Start difference. First operand 725 states and 1649 transitions. Second operand 9 states. [2018-07-25 08:36:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:49,205 INFO L93 Difference]: Finished difference Result 1244 states and 2740 transitions. [2018-07-25 08:36:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:36:49,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:36:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:49,208 INFO L225 Difference]: With dead ends: 1244 [2018-07-25 08:36:49,208 INFO L226 Difference]: Without dead ends: 1236 [2018-07-25 08:36:49,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:36:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-07-25 08:36:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 729. [2018-07-25 08:36:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-07-25 08:36:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1657 transitions. [2018-07-25 08:36:49,918 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1657 transitions. Word has length 16 [2018-07-25 08:36:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:49,918 INFO L472 AbstractCegarLoop]: Abstraction has 729 states and 1657 transitions. [2018-07-25 08:36:49,918 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1657 transitions. [2018-07-25 08:36:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:49,920 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:49,920 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:49,920 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-07-25 08:36:49,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:49,932 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-25 08:36:49,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:49,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:49,933 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:49,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:49,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:49,934 INFO L87 Difference]: Start difference. First operand 729 states and 1657 transitions. Second operand 9 states. [2018-07-25 08:36:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:51,626 INFO L93 Difference]: Finished difference Result 1187 states and 2621 transitions. [2018-07-25 08:36:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:36:51,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:36:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:51,629 INFO L225 Difference]: With dead ends: 1187 [2018-07-25 08:36:51,629 INFO L226 Difference]: Without dead ends: 1179 [2018-07-25 08:36:51,630 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:36:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-07-25 08:36:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 753. [2018-07-25 08:36:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-07-25 08:36:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1711 transitions. [2018-07-25 08:36:52,878 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1711 transitions. Word has length 16 [2018-07-25 08:36:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:52,878 INFO L472 AbstractCegarLoop]: Abstraction has 753 states and 1711 transitions. [2018-07-25 08:36:52,878 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1711 transitions. [2018-07-25 08:36:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:52,879 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:52,879 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:52,880 INFO L415 AbstractCegarLoop]: === Iteration 31 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:52,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1147109874, now seen corresponding path program 1 times [2018-07-25 08:36:52,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:52,889 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-25 08:36:52,890 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:52,890 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:52,890 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:52,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:52,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:52,891 INFO L87 Difference]: Start difference. First operand 753 states and 1711 transitions. Second operand 9 states. [2018-07-25 08:36:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:54,296 INFO L93 Difference]: Finished difference Result 1221 states and 2662 transitions. [2018-07-25 08:36:54,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:36:54,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:36:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:54,299 INFO L225 Difference]: With dead ends: 1221 [2018-07-25 08:36:54,299 INFO L226 Difference]: Without dead ends: 1213 [2018-07-25 08:36:54,300 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:36:54,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2018-07-25 08:36:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 741. [2018-07-25 08:36:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-07-25 08:36:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1684 transitions. [2018-07-25 08:36:55,196 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1684 transitions. Word has length 16 [2018-07-25 08:36:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:55,196 INFO L472 AbstractCegarLoop]: Abstraction has 741 states and 1684 transitions. [2018-07-25 08:36:55,196 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1684 transitions. [2018-07-25 08:36:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:55,197 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:55,197 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:55,197 INFO L415 AbstractCegarLoop]: === Iteration 32 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1762524116, now seen corresponding path program 1 times [2018-07-25 08:36:55,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:55,206 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-25 08:36:55,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:55,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:55,207 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:55,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:55,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:55,208 INFO L87 Difference]: Start difference. First operand 741 states and 1684 transitions. Second operand 9 states. [2018-07-25 08:36:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:56,802 INFO L93 Difference]: Finished difference Result 1356 states and 2971 transitions. [2018-07-25 08:36:56,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:36:56,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:36:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:56,806 INFO L225 Difference]: With dead ends: 1356 [2018-07-25 08:36:56,806 INFO L226 Difference]: Without dead ends: 1348 [2018-07-25 08:36:56,807 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:36:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-07-25 08:36:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 737. [2018-07-25 08:36:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-07-25 08:36:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1676 transitions. [2018-07-25 08:36:57,653 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1676 transitions. Word has length 16 [2018-07-25 08:36:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:57,653 INFO L472 AbstractCegarLoop]: Abstraction has 737 states and 1676 transitions. [2018-07-25 08:36:57,653 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1676 transitions. [2018-07-25 08:36:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:57,654 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:57,654 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:57,654 INFO L415 AbstractCegarLoop]: === Iteration 33 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash 352691054, now seen corresponding path program 1 times [2018-07-25 08:36:57,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:57,663 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-25 08:36:57,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:57,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:57,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:57,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:57,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:57,665 INFO L87 Difference]: Start difference. First operand 737 states and 1676 transitions. Second operand 9 states. [2018-07-25 08:36:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:59,280 INFO L93 Difference]: Finished difference Result 1200 states and 2616 transitions. [2018-07-25 08:36:59,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:36:59,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:36:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:59,283 INFO L225 Difference]: With dead ends: 1200 [2018-07-25 08:36:59,283 INFO L226 Difference]: Without dead ends: 1192 [2018-07-25 08:36:59,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:36:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-07-25 08:36:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 645. [2018-07-25 08:36:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-07-25 08:36:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1456 transitions. [2018-07-25 08:36:59,967 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1456 transitions. Word has length 16 [2018-07-25 08:36:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:59,967 INFO L472 AbstractCegarLoop]: Abstraction has 645 states and 1456 transitions. [2018-07-25 08:36:59,967 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1456 transitions. [2018-07-25 08:36:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:59,968 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:59,968 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:59,969 INFO L415 AbstractCegarLoop]: === Iteration 34 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-07-25 08:36:59,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:59,978 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-25 08:36:59,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:59,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:59,978 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:59,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:59,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:59,979 INFO L87 Difference]: Start difference. First operand 645 states and 1456 transitions. Second operand 9 states. [2018-07-25 08:37:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:01,292 INFO L93 Difference]: Finished difference Result 978 states and 2118 transitions. [2018-07-25 08:37:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:01,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:37:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:01,295 INFO L225 Difference]: With dead ends: 978 [2018-07-25 08:37:01,295 INFO L226 Difference]: Without dead ends: 970 [2018-07-25 08:37:01,296 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:37:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-07-25 08:37:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 655. [2018-07-25 08:37:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-07-25 08:37:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1483 transitions. [2018-07-25 08:37:02,026 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1483 transitions. Word has length 16 [2018-07-25 08:37:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:02,026 INFO L472 AbstractCegarLoop]: Abstraction has 655 states and 1483 transitions. [2018-07-25 08:37:02,027 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1483 transitions. [2018-07-25 08:37:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:02,027 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:02,027 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:02,028 INFO L415 AbstractCegarLoop]: === Iteration 35 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-07-25 08:37:02,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:02,035 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-25 08:37:02,035 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:02,035 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:02,035 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:02,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:02,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:02,036 INFO L87 Difference]: Start difference. First operand 655 states and 1483 transitions. Second operand 9 states. [2018-07-25 08:37:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:03,183 INFO L93 Difference]: Finished difference Result 920 states and 1979 transitions. [2018-07-25 08:37:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:03,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:37:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:03,184 INFO L225 Difference]: With dead ends: 920 [2018-07-25 08:37:03,184 INFO L226 Difference]: Without dead ends: 912 [2018-07-25 08:37:03,185 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-07-25 08:37:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 651. [2018-07-25 08:37:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-07-25 08:37:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1473 transitions. [2018-07-25 08:37:03,836 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1473 transitions. Word has length 16 [2018-07-25 08:37:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:03,836 INFO L472 AbstractCegarLoop]: Abstraction has 651 states and 1473 transitions. [2018-07-25 08:37:03,836 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1473 transitions. [2018-07-25 08:37:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:03,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:03,837 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:03,837 INFO L415 AbstractCegarLoop]: === Iteration 36 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1203705624, now seen corresponding path program 1 times [2018-07-25 08:37:03,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:03,845 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-25 08:37:03,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:03,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:03,846 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:03,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:03,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:03,846 INFO L87 Difference]: Start difference. First operand 651 states and 1473 transitions. Second operand 9 states. [2018-07-25 08:37:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:04,906 INFO L93 Difference]: Finished difference Result 859 states and 1857 transitions. [2018-07-25 08:37:04,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:04,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:37:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:04,908 INFO L225 Difference]: With dead ends: 859 [2018-07-25 08:37:04,908 INFO L226 Difference]: Without dead ends: 851 [2018-07-25 08:37:04,908 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-07-25 08:37:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 664. [2018-07-25 08:37:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-07-25 08:37:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1495 transitions. [2018-07-25 08:37:05,574 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1495 transitions. Word has length 16 [2018-07-25 08:37:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:05,574 INFO L472 AbstractCegarLoop]: Abstraction has 664 states and 1495 transitions. [2018-07-25 08:37:05,574 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1495 transitions. [2018-07-25 08:37:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:05,575 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:05,575 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:05,576 INFO L415 AbstractCegarLoop]: === Iteration 37 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:05,576 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-07-25 08:37:05,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:05,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:05,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:05,584 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:05,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:05,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:05,585 INFO L87 Difference]: Start difference. First operand 664 states and 1495 transitions. Second operand 8 states. [2018-07-25 08:37:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:06,862 INFO L93 Difference]: Finished difference Result 1152 states and 2505 transitions. [2018-07-25 08:37:06,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:37:06,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:06,864 INFO L225 Difference]: With dead ends: 1152 [2018-07-25 08:37:06,864 INFO L226 Difference]: Without dead ends: 1144 [2018-07-25 08:37:06,865 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:37:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2018-07-25 08:37:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 847. [2018-07-25 08:37:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-07-25 08:37:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1923 transitions. [2018-07-25 08:37:07,752 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1923 transitions. Word has length 16 [2018-07-25 08:37:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:07,752 INFO L472 AbstractCegarLoop]: Abstraction has 847 states and 1923 transitions. [2018-07-25 08:37:07,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1923 transitions. [2018-07-25 08:37:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:07,753 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:07,753 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:07,754 INFO L415 AbstractCegarLoop]: === Iteration 38 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-07-25 08:37:07,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:07,761 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:07,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:07,762 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:07,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:07,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:07,762 INFO L87 Difference]: Start difference. First operand 847 states and 1923 transitions. Second operand 8 states. [2018-07-25 08:37:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:09,292 INFO L93 Difference]: Finished difference Result 1279 states and 2776 transitions. [2018-07-25 08:37:09,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:37:09,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:09,294 INFO L225 Difference]: With dead ends: 1279 [2018-07-25 08:37:09,294 INFO L226 Difference]: Without dead ends: 1271 [2018-07-25 08:37:09,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:37:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2018-07-25 08:37:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 855. [2018-07-25 08:37:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-07-25 08:37:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1939 transitions. [2018-07-25 08:37:10,133 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1939 transitions. Word has length 16 [2018-07-25 08:37:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:10,133 INFO L472 AbstractCegarLoop]: Abstraction has 855 states and 1939 transitions. [2018-07-25 08:37:10,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1939 transitions. [2018-07-25 08:37:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:10,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:10,134 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:10,135 INFO L415 AbstractCegarLoop]: === Iteration 39 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-07-25 08:37:10,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:10,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:10,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:10,142 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:10,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:10,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:10,143 INFO L87 Difference]: Start difference. First operand 855 states and 1939 transitions. Second operand 8 states. [2018-07-25 08:37:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:11,773 INFO L93 Difference]: Finished difference Result 1342 states and 2933 transitions. [2018-07-25 08:37:11,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:11,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:11,775 INFO L225 Difference]: With dead ends: 1342 [2018-07-25 08:37:11,775 INFO L226 Difference]: Without dead ends: 1334 [2018-07-25 08:37:11,775 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:37:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-07-25 08:37:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 916. [2018-07-25 08:37:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-07-25 08:37:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2080 transitions. [2018-07-25 08:37:12,677 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2080 transitions. Word has length 16 [2018-07-25 08:37:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:12,678 INFO L472 AbstractCegarLoop]: Abstraction has 916 states and 2080 transitions. [2018-07-25 08:37:12,678 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2080 transitions. [2018-07-25 08:37:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:12,679 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:12,679 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:12,679 INFO L415 AbstractCegarLoop]: === Iteration 40 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-07-25 08:37:12,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:12,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:12,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:12,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:12,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:12,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:12,689 INFO L87 Difference]: Start difference. First operand 916 states and 2080 transitions. Second operand 8 states. [2018-07-25 08:37:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:14,247 INFO L93 Difference]: Finished difference Result 1371 states and 2977 transitions. [2018-07-25 08:37:14,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:14,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:14,249 INFO L225 Difference]: With dead ends: 1371 [2018-07-25 08:37:14,249 INFO L226 Difference]: Without dead ends: 1363 [2018-07-25 08:37:14,249 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:37:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2018-07-25 08:37:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 937. [2018-07-25 08:37:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2018-07-25 08:37:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2125 transitions. [2018-07-25 08:37:15,172 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2125 transitions. Word has length 16 [2018-07-25 08:37:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:15,172 INFO L472 AbstractCegarLoop]: Abstraction has 937 states and 2125 transitions. [2018-07-25 08:37:15,172 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2125 transitions. [2018-07-25 08:37:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:15,173 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:15,173 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:15,173 INFO L415 AbstractCegarLoop]: === Iteration 41 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:15,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-07-25 08:37:15,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:15,181 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:15,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:15,181 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:15,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:15,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:15,182 INFO L87 Difference]: Start difference. First operand 937 states and 2125 transitions. Second operand 8 states. [2018-07-25 08:37:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:17,090 INFO L93 Difference]: Finished difference Result 1543 states and 3361 transitions. [2018-07-25 08:37:17,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:17,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:17,092 INFO L225 Difference]: With dead ends: 1543 [2018-07-25 08:37:17,092 INFO L226 Difference]: Without dead ends: 1535 [2018-07-25 08:37:17,093 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2018-07-25 08:37:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 920. [2018-07-25 08:37:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2018-07-25 08:37:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2088 transitions. [2018-07-25 08:37:18,029 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2088 transitions. Word has length 16 [2018-07-25 08:37:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:18,029 INFO L472 AbstractCegarLoop]: Abstraction has 920 states and 2088 transitions. [2018-07-25 08:37:18,029 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2088 transitions. [2018-07-25 08:37:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:18,030 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:18,031 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:18,031 INFO L415 AbstractCegarLoop]: === Iteration 42 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:18,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1137226608, now seen corresponding path program 1 times [2018-07-25 08:37:18,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:18,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:18,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:18,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:18,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:18,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:18,043 INFO L87 Difference]: Start difference. First operand 920 states and 2088 transitions. Second operand 8 states. [2018-07-25 08:37:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:19,873 INFO L93 Difference]: Finished difference Result 1402 states and 3065 transitions. [2018-07-25 08:37:19,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:19,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:19,875 INFO L225 Difference]: With dead ends: 1402 [2018-07-25 08:37:19,876 INFO L226 Difference]: Without dead ends: 1394 [2018-07-25 08:37:19,877 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-07-25 08:37:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 933. [2018-07-25 08:37:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-07-25 08:37:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2117 transitions. [2018-07-25 08:37:20,888 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2117 transitions. Word has length 16 [2018-07-25 08:37:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:20,888 INFO L472 AbstractCegarLoop]: Abstraction has 933 states and 2117 transitions. [2018-07-25 08:37:20,888 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2117 transitions. [2018-07-25 08:37:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:20,889 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:20,889 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:20,889 INFO L415 AbstractCegarLoop]: === Iteration 43 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:20,889 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-07-25 08:37:20,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:20,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:20,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:20,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:20,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:20,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:20,898 INFO L87 Difference]: Start difference. First operand 933 states and 2117 transitions. Second operand 8 states. [2018-07-25 08:37:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:22,316 INFO L93 Difference]: Finished difference Result 1226 states and 2691 transitions. [2018-07-25 08:37:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:22,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:22,318 INFO L225 Difference]: With dead ends: 1226 [2018-07-25 08:37:22,318 INFO L226 Difference]: Without dead ends: 1218 [2018-07-25 08:37:22,319 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:37:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-07-25 08:37:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 916. [2018-07-25 08:37:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-07-25 08:37:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2074 transitions. [2018-07-25 08:37:23,293 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2074 transitions. Word has length 16 [2018-07-25 08:37:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:23,293 INFO L472 AbstractCegarLoop]: Abstraction has 916 states and 2074 transitions. [2018-07-25 08:37:23,293 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2074 transitions. [2018-07-25 08:37:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:23,293 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:23,294 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:23,294 INFO L415 AbstractCegarLoop]: === Iteration 44 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:23,294 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-07-25 08:37:23,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:23,300 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:23,300 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:23,300 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:23,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:23,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:23,301 INFO L87 Difference]: Start difference. First operand 916 states and 2074 transitions. Second operand 8 states. [2018-07-25 08:37:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:25,051 INFO L93 Difference]: Finished difference Result 1398 states and 3075 transitions. [2018-07-25 08:37:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:25,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:25,053 INFO L225 Difference]: With dead ends: 1398 [2018-07-25 08:37:25,053 INFO L226 Difference]: Without dead ends: 1390 [2018-07-25 08:37:25,054 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:37:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2018-07-25 08:37:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 899. [2018-07-25 08:37:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-07-25 08:37:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2037 transitions. [2018-07-25 08:37:26,052 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2037 transitions. Word has length 16 [2018-07-25 08:37:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:26,052 INFO L472 AbstractCegarLoop]: Abstraction has 899 states and 2037 transitions. [2018-07-25 08:37:26,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2037 transitions. [2018-07-25 08:37:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:26,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:26,053 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:26,053 INFO L415 AbstractCegarLoop]: === Iteration 45 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:26,053 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-07-25 08:37:26,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:26,058 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:26,058 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:26,058 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:26,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:26,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:26,059 INFO L87 Difference]: Start difference. First operand 899 states and 2037 transitions. Second operand 8 states. [2018-07-25 08:37:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:27,871 INFO L93 Difference]: Finished difference Result 1445 states and 3179 transitions. [2018-07-25 08:37:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:37:27,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:27,873 INFO L225 Difference]: With dead ends: 1445 [2018-07-25 08:37:27,873 INFO L226 Difference]: Without dead ends: 1437 [2018-07-25 08:37:27,874 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:37:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2018-07-25 08:37:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 895. [2018-07-25 08:37:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-07-25 08:37:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2029 transitions. [2018-07-25 08:37:28,822 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2029 transitions. Word has length 16 [2018-07-25 08:37:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:28,822 INFO L472 AbstractCegarLoop]: Abstraction has 895 states and 2029 transitions. [2018-07-25 08:37:28,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2029 transitions. [2018-07-25 08:37:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:37:28,823 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:28,823 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:28,823 INFO L415 AbstractCegarLoop]: === Iteration 46 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1012397261, now seen corresponding path program 1 times [2018-07-25 08:37:28,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:28,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:28,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:28,831 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:37:28,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:37:28,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:37:28,832 INFO L87 Difference]: Start difference. First operand 895 states and 2029 transitions. Second operand 8 states. [2018-07-25 08:37:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:30,276 INFO L93 Difference]: Finished difference Result 1158 states and 2543 transitions. [2018-07-25 08:37:30,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:30,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:37:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:30,278 INFO L225 Difference]: With dead ends: 1158 [2018-07-25 08:37:30,278 INFO L226 Difference]: Without dead ends: 1150 [2018-07-25 08:37:30,279 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:37:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-07-25 08:37:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 856. [2018-07-25 08:37:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-25 08:37:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1928 transitions. [2018-07-25 08:37:31,375 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1928 transitions. Word has length 16 [2018-07-25 08:37:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:31,375 INFO L472 AbstractCegarLoop]: Abstraction has 856 states and 1928 transitions. [2018-07-25 08:37:31,376 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:37:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1928 transitions. [2018-07-25 08:37:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:37:31,376 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:31,376 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:31,376 INFO L415 AbstractCegarLoop]: === Iteration 47 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1223690942, now seen corresponding path program 1 times [2018-07-25 08:37:31,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:31,390 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-25 08:37:31,390 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:31,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:31,390 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:31,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:31,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:31,391 INFO L87 Difference]: Start difference. First operand 856 states and 1928 transitions. Second operand 11 states. [2018-07-25 08:37:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:33,765 INFO L93 Difference]: Finished difference Result 1562 states and 3408 transitions. [2018-07-25 08:37:33,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:37:33,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-07-25 08:37:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:33,768 INFO L225 Difference]: With dead ends: 1562 [2018-07-25 08:37:33,768 INFO L226 Difference]: Without dead ends: 1554 [2018-07-25 08:37:33,769 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:37:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2018-07-25 08:37:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1302. [2018-07-25 08:37:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2018-07-25 08:37:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2930 transitions. [2018-07-25 08:37:35,271 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 2930 transitions. Word has length 17 [2018-07-25 08:37:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:35,271 INFO L472 AbstractCegarLoop]: Abstraction has 1302 states and 2930 transitions. [2018-07-25 08:37:35,271 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 2930 transitions. [2018-07-25 08:37:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:35,272 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:35,272 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:35,272 INFO L415 AbstractCegarLoop]: === Iteration 48 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash 532189918, now seen corresponding path program 1 times [2018-07-25 08:37:35,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:35,283 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-25 08:37:35,283 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:35,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:35,283 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:35,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:35,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:35,284 INFO L87 Difference]: Start difference. First operand 1302 states and 2930 transitions. Second operand 11 states. [2018-07-25 08:37:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:38,559 INFO L93 Difference]: Finished difference Result 2066 states and 4562 transitions. [2018-07-25 08:37:38,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:37:38,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:37:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:38,563 INFO L225 Difference]: With dead ends: 2066 [2018-07-25 08:37:38,563 INFO L226 Difference]: Without dead ends: 2058 [2018-07-25 08:37:38,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:37:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2018-07-25 08:37:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1536. [2018-07-25 08:37:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2018-07-25 08:37:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 3466 transitions. [2018-07-25 08:37:40,796 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 3466 transitions. Word has length 20 [2018-07-25 08:37:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:40,796 INFO L472 AbstractCegarLoop]: Abstraction has 1536 states and 3466 transitions. [2018-07-25 08:37:40,796 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 3466 transitions. [2018-07-25 08:37:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:40,797 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:40,798 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:40,798 INFO L415 AbstractCegarLoop]: === Iteration 49 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1283316220, now seen corresponding path program 1 times [2018-07-25 08:37:40,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:40,811 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-25 08:37:40,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:40,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:40,812 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:40,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:40,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:40,812 INFO L87 Difference]: Start difference. First operand 1536 states and 3466 transitions. Second operand 11 states. [2018-07-25 08:37:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:44,455 INFO L93 Difference]: Finished difference Result 2629 states and 5838 transitions. [2018-07-25 08:37:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:37:44,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:37:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:44,459 INFO L225 Difference]: With dead ends: 2629 [2018-07-25 08:37:44,459 INFO L226 Difference]: Without dead ends: 2621 [2018-07-25 08:37:44,460 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:37:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2018-07-25 08:37:47,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2078. [2018-07-25 08:37:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2018-07-25 08:37:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 4754 transitions. [2018-07-25 08:37:47,184 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 4754 transitions. Word has length 20 [2018-07-25 08:37:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:47,184 INFO L472 AbstractCegarLoop]: Abstraction has 2078 states and 4754 transitions. [2018-07-25 08:37:47,184 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 4754 transitions. [2018-07-25 08:37:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:47,187 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:47,187 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:47,187 INFO L415 AbstractCegarLoop]: === Iteration 50 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:47,187 INFO L82 PathProgramCache]: Analyzing trace with hash -214966810, now seen corresponding path program 1 times [2018-07-25 08:37:47,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:47,202 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-25 08:37:47,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:47,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:47,203 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:47,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:47,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:47,204 INFO L87 Difference]: Start difference. First operand 2078 states and 4754 transitions. Second operand 11 states. [2018-07-25 08:37:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:52,758 INFO L93 Difference]: Finished difference Result 4196 states and 9626 transitions. [2018-07-25 08:37:52,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:37:52,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:37:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:52,764 INFO L225 Difference]: With dead ends: 4196 [2018-07-25 08:37:52,764 INFO L226 Difference]: Without dead ends: 4188 [2018-07-25 08:37:52,766 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:37:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2018-07-25 08:37:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2494. [2018-07-25 08:37:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2494 states. [2018-07-25 08:37:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5846 transitions. [2018-07-25 08:37:55,713 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5846 transitions. Word has length 20 [2018-07-25 08:37:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:55,713 INFO L472 AbstractCegarLoop]: Abstraction has 2494 states and 5846 transitions. [2018-07-25 08:37:55,713 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5846 transitions. [2018-07-25 08:37:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:55,714 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:55,714 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:55,715 INFO L415 AbstractCegarLoop]: === Iteration 51 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:55,715 INFO L82 PathProgramCache]: Analyzing trace with hash 523391216, now seen corresponding path program 1 times [2018-07-25 08:37:55,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:55,725 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-25 08:37:55,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:55,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:55,726 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:55,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:55,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:55,727 INFO L87 Difference]: Start difference. First operand 2494 states and 5846 transitions. Second operand 11 states. [2018-07-25 08:38:01,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:01,138 INFO L93 Difference]: Finished difference Result 4092 states and 9349 transitions. [2018-07-25 08:38:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:38:01,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:38:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:01,143 INFO L225 Difference]: With dead ends: 4092 [2018-07-25 08:38:01,143 INFO L226 Difference]: Without dead ends: 4084 [2018-07-25 08:38:01,145 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=450, Invalid=2306, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:38:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4084 states. [2018-07-25 08:38:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4084 to 2506. [2018-07-25 08:38:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2018-07-25 08:38:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 5876 transitions. [2018-07-25 08:38:04,145 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 5876 transitions. Word has length 20 [2018-07-25 08:38:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:04,145 INFO L472 AbstractCegarLoop]: Abstraction has 2506 states and 5876 transitions. [2018-07-25 08:38:04,145 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 5876 transitions. [2018-07-25 08:38:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:38:04,147 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:04,147 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:04,147 INFO L415 AbstractCegarLoop]: === Iteration 52 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash 520590862, now seen corresponding path program 1 times [2018-07-25 08:38:04,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:04,157 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-25 08:38:04,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:04,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:04,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:04,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:04,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:04,159 INFO L87 Difference]: Start difference. First operand 2506 states and 5876 transitions. Second operand 11 states. [2018-07-25 08:38:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:09,829 INFO L93 Difference]: Finished difference Result 4084 states and 9319 transitions. [2018-07-25 08:38:09,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:38:09,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:38:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:09,835 INFO L225 Difference]: With dead ends: 4084 [2018-07-25 08:38:09,835 INFO L226 Difference]: Without dead ends: 4076 [2018-07-25 08:38:09,837 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=354, Invalid=1716, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:38:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-07-25 08:38:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2630. [2018-07-25 08:38:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-07-25 08:38:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 6208 transitions. [2018-07-25 08:38:13,020 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 6208 transitions. Word has length 20 [2018-07-25 08:38:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:13,020 INFO L472 AbstractCegarLoop]: Abstraction has 2630 states and 6208 transitions. [2018-07-25 08:38:13,020 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 6208 transitions. [2018-07-25 08:38:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:38:13,022 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:13,022 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:13,022 INFO L415 AbstractCegarLoop]: === Iteration 53 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash 520693007, now seen corresponding path program 1 times [2018-07-25 08:38:13,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:13,032 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:13,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:13,032 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:13,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:13,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:13,032 INFO L87 Difference]: Start difference. First operand 2630 states and 6208 transitions. Second operand 11 states. [2018-07-25 08:38:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:18,449 INFO L93 Difference]: Finished difference Result 3737 states and 8511 transitions. [2018-07-25 08:38:18,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:38:18,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:38:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:18,453 INFO L225 Difference]: With dead ends: 3737 [2018-07-25 08:38:18,453 INFO L226 Difference]: Without dead ends: 3729 [2018-07-25 08:38:18,454 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:38:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2018-07-25 08:38:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 2684. [2018-07-25 08:38:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2018-07-25 08:38:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 6332 transitions. [2018-07-25 08:38:21,634 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 6332 transitions. Word has length 20 [2018-07-25 08:38:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:21,634 INFO L472 AbstractCegarLoop]: Abstraction has 2684 states and 6332 transitions. [2018-07-25 08:38:21,634 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 6332 transitions. [2018-07-25 08:38:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:38:21,636 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:21,636 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:21,637 INFO L415 AbstractCegarLoop]: === Iteration 54 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:21,637 INFO L82 PathProgramCache]: Analyzing trace with hash 759878049, now seen corresponding path program 1 times [2018-07-25 08:38:21,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:21,648 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-25 08:38:21,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:21,649 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:21,649 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:21,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:21,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:21,649 INFO L87 Difference]: Start difference. First operand 2684 states and 6332 transitions. Second operand 11 states. [2018-07-25 08:38:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:26,197 INFO L93 Difference]: Finished difference Result 3287 states and 7584 transitions. [2018-07-25 08:38:26,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:38:26,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:38:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:26,201 INFO L225 Difference]: With dead ends: 3287 [2018-07-25 08:38:26,202 INFO L226 Difference]: Without dead ends: 3279 [2018-07-25 08:38:26,203 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:38:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2018-07-25 08:38:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2762. [2018-07-25 08:38:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2018-07-25 08:38:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 6495 transitions. [2018-07-25 08:38:29,567 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 6495 transitions. Word has length 20 [2018-07-25 08:38:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:29,567 INFO L472 AbstractCegarLoop]: Abstraction has 2762 states and 6495 transitions. [2018-07-25 08:38:29,567 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 6495 transitions. [2018-07-25 08:38:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:38:29,568 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:29,568 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:29,569 INFO L415 AbstractCegarLoop]: === Iteration 55 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:29,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1511004351, now seen corresponding path program 1 times [2018-07-25 08:38:29,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:29,582 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-25 08:38:29,583 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:29,583 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:29,583 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:29,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:29,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:29,584 INFO L87 Difference]: Start difference. First operand 2762 states and 6495 transitions. Second operand 11 states. [2018-07-25 08:38:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:34,781 INFO L93 Difference]: Finished difference Result 3559 states and 8170 transitions. [2018-07-25 08:38:34,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:38:34,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:38:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:34,787 INFO L225 Difference]: With dead ends: 3559 [2018-07-25 08:38:34,787 INFO L226 Difference]: Without dead ends: 3551 [2018-07-25 08:38:34,788 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:38:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2018-07-25 08:38:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 2944. [2018-07-25 08:38:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2018-07-25 08:38:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 6904 transitions. [2018-07-25 08:38:38,409 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 6904 transitions. Word has length 20 [2018-07-25 08:38:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:38,409 INFO L472 AbstractCegarLoop]: Abstraction has 2944 states and 6904 transitions. [2018-07-25 08:38:38,409 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 6904 transitions. [2018-07-25 08:38:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:38:38,411 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:38,411 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:38,411 INFO L415 AbstractCegarLoop]: === Iteration 56 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:38,411 INFO L82 PathProgramCache]: Analyzing trace with hash 12721321, now seen corresponding path program 1 times [2018-07-25 08:38:38,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:38,422 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-25 08:38:38,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:38,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:38,422 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:38,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:38,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:38,423 INFO L87 Difference]: Start difference. First operand 2944 states and 6904 transitions. Second operand 11 states. [2018-07-25 08:38:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:43,914 INFO L93 Difference]: Finished difference Result 3950 states and 9027 transitions. [2018-07-25 08:38:43,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:38:43,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:38:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:43,919 INFO L225 Difference]: With dead ends: 3950 [2018-07-25 08:38:43,919 INFO L226 Difference]: Without dead ends: 3942 [2018-07-25 08:38:43,920 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:38:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2018-07-25 08:38:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3054. [2018-07-25 08:38:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2018-07-25 08:38:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 7161 transitions. [2018-07-25 08:38:47,617 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 7161 transitions. Word has length 20 [2018-07-25 08:38:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:47,617 INFO L472 AbstractCegarLoop]: Abstraction has 3054 states and 7161 transitions. [2018-07-25 08:38:47,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 7161 transitions. [2018-07-25 08:38:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:38:47,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:47,618 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:47,619 INFO L415 AbstractCegarLoop]: === Iteration 57 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash 751079347, now seen corresponding path program 1 times [2018-07-25 08:38:47,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:47,628 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-25 08:38:47,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:47,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:47,628 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:47,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:47,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:47,629 INFO L87 Difference]: Start difference. First operand 3054 states and 7161 transitions. Second operand 11 states. [2018-07-25 08:38:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:52,484 INFO L93 Difference]: Finished difference Result 3761 states and 8627 transitions. [2018-07-25 08:38:52,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:38:52,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:38:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:52,489 INFO L225 Difference]: With dead ends: 3761 [2018-07-25 08:38:52,490 INFO L226 Difference]: Without dead ends: 3753 [2018-07-25 08:38:52,492 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=262, Invalid=1298, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:38:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2018-07-25 08:38:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 3054. [2018-07-25 08:38:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2018-07-25 08:38:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 7161 transitions. [2018-07-25 08:38:56,224 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 7161 transitions. Word has length 20 [2018-07-25 08:38:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:56,224 INFO L472 AbstractCegarLoop]: Abstraction has 3054 states and 7161 transitions. [2018-07-25 08:38:56,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:38:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 7161 transitions. [2018-07-25 08:38:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:38:56,226 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:56,226 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:56,226 INFO L415 AbstractCegarLoop]: === Iteration 58 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash 748278993, now seen corresponding path program 1 times [2018-07-25 08:38:56,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:56,239 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-25 08:38:56,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:56,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:38:56,239 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:38:56,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:38:56,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:38:56,240 INFO L87 Difference]: Start difference. First operand 3054 states and 7161 transitions. Second operand 11 states. [2018-07-25 08:39:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:01,256 INFO L93 Difference]: Finished difference Result 3732 states and 8563 transitions. [2018-07-25 08:39:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:39:01,256 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:39:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:01,264 INFO L225 Difference]: With dead ends: 3732 [2018-07-25 08:39:01,264 INFO L226 Difference]: Without dead ends: 3724 [2018-07-25 08:39:01,266 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:39:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2018-07-25 08:39:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3026. [2018-07-25 08:39:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3026 states. [2018-07-25 08:39:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 7081 transitions. [2018-07-25 08:39:04,989 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 7081 transitions. Word has length 20 [2018-07-25 08:39:04,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:04,989 INFO L472 AbstractCegarLoop]: Abstraction has 3026 states and 7081 transitions. [2018-07-25 08:39:04,989 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:39:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 7081 transitions. [2018-07-25 08:39:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:39:04,991 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:04,991 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:04,991 INFO L415 AbstractCegarLoop]: === Iteration 59 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:04,991 INFO L82 PathProgramCache]: Analyzing trace with hash 748381138, now seen corresponding path program 1 times [2018-07-25 08:39:04,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:05,001 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-25 08:39:05,001 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:05,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:39:05,002 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:39:05,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:39:05,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:39:05,002 INFO L87 Difference]: Start difference. First operand 3026 states and 7081 transitions. Second operand 11 states. [2018-07-25 08:39:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:09,501 INFO L93 Difference]: Finished difference Result 3407 states and 7825 transitions. [2018-07-25 08:39:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:39:09,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:39:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:09,505 INFO L225 Difference]: With dead ends: 3407 [2018-07-25 08:39:09,505 INFO L226 Difference]: Without dead ends: 3399 [2018-07-25 08:39:09,506 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:39:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2018-07-25 08:39:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3008. [2018-07-25 08:39:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-07-25 08:39:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 7021 transitions. [2018-07-25 08:39:13,218 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 7021 transitions. Word has length 20 [2018-07-25 08:39:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:13,218 INFO L472 AbstractCegarLoop]: Abstraction has 3008 states and 7021 transitions. [2018-07-25 08:39:13,218 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:39:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 7021 transitions. [2018-07-25 08:39:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:39:13,220 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:13,220 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:13,220 INFO L415 AbstractCegarLoop]: === Iteration 60 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1524516609, now seen corresponding path program 1 times [2018-07-25 08:39:13,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:13,233 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-25 08:39:13,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:13,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:39:13,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:39:13,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:39:13,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:39:13,234 INFO L87 Difference]: Start difference. First operand 3008 states and 7021 transitions. Second operand 11 states. [2018-07-25 08:39:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:18,748 INFO L93 Difference]: Finished difference Result 3906 states and 8949 transitions. [2018-07-25 08:39:18,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:39:18,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:39:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:18,753 INFO L225 Difference]: With dead ends: 3906 [2018-07-25 08:39:18,753 INFO L226 Difference]: Without dead ends: 3898 [2018-07-25 08:39:18,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:39:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2018-07-25 08:39:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3115. [2018-07-25 08:39:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2018-07-25 08:39:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 7274 transitions. [2018-07-25 08:39:22,711 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 7274 transitions. Word has length 20 [2018-07-25 08:39:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:22,712 INFO L472 AbstractCegarLoop]: Abstraction has 3115 states and 7274 transitions. [2018-07-25 08:39:22,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:39:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 7274 transitions. [2018-07-25 08:39:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:39:22,713 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:22,713 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:22,713 INFO L415 AbstractCegarLoop]: === Iteration 61 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash 26233579, now seen corresponding path program 1 times [2018-07-25 08:39:22,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:22,722 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-25 08:39:22,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:22,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:39:22,722 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:39:22,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:39:22,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:39:22,723 INFO L87 Difference]: Start difference. First operand 3115 states and 7274 transitions. Second operand 11 states. [2018-07-25 08:39:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:28,654 INFO L93 Difference]: Finished difference Result 4110 states and 9407 transitions. [2018-07-25 08:39:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:39:28,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:39:28,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:28,659 INFO L225 Difference]: With dead ends: 4110 [2018-07-25 08:39:28,659 INFO L226 Difference]: Without dead ends: 4102 [2018-07-25 08:39:28,660 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=929, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:39:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2018-07-25 08:39:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3126. [2018-07-25 08:39:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2018-07-25 08:39:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 7289 transitions. [2018-07-25 08:39:32,589 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 7289 transitions. Word has length 20 [2018-07-25 08:39:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:32,589 INFO L472 AbstractCegarLoop]: Abstraction has 3126 states and 7289 transitions. [2018-07-25 08:39:32,589 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:39:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 7289 transitions. [2018-07-25 08:39:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:39:32,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:32,591 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:32,591 INFO L415 AbstractCegarLoop]: === Iteration 62 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:32,591 INFO L82 PathProgramCache]: Analyzing trace with hash 764591605, now seen corresponding path program 1 times [2018-07-25 08:39:32,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:32,600 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-25 08:39:32,600 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:32,600 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:39:32,601 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:39:32,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:39:32,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:39:32,601 INFO L87 Difference]: Start difference. First operand 3126 states and 7289 transitions. Second operand 11 states. [2018-07-25 08:39:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:38,337 INFO L93 Difference]: Finished difference Result 4192 states and 9618 transitions. [2018-07-25 08:39:38,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:39:38,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:39:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:38,343 INFO L225 Difference]: With dead ends: 4192 [2018-07-25 08:39:38,343 INFO L226 Difference]: Without dead ends: 4184 [2018-07-25 08:39:38,345 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:39:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2018-07-25 08:39:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3137. [2018-07-25 08:39:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2018-07-25 08:39:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 7311 transitions. [2018-07-25 08:39:42,369 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 7311 transitions. Word has length 20 [2018-07-25 08:39:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:42,369 INFO L472 AbstractCegarLoop]: Abstraction has 3137 states and 7311 transitions. [2018-07-25 08:39:42,369 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:39:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 7311 transitions. [2018-07-25 08:39:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:39:42,370 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:42,370 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:42,371 INFO L415 AbstractCegarLoop]: === Iteration 63 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash 761791251, now seen corresponding path program 1 times [2018-07-25 08:39:42,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:42,382 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-25 08:39:42,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:42,382 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:39:42,383 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:39:42,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:39:42,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:39:42,383 INFO L87 Difference]: Start difference. First operand 3137 states and 7311 transitions. Second operand 11 states. [2018-07-25 08:39:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:48,111 INFO L93 Difference]: Finished difference Result 4267 states and 9777 transitions. [2018-07-25 08:39:48,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:39:48,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:39:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:48,116 INFO L225 Difference]: With dead ends: 4267 [2018-07-25 08:39:48,116 INFO L226 Difference]: Without dead ends: 4259 [2018-07-25 08:39:48,117 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:39:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2018-07-25 08:39:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 3231. [2018-07-25 08:39:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3231 states. [2018-07-25 08:39:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 7541 transitions. [2018-07-25 08:39:52,206 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 7541 transitions. Word has length 20 [2018-07-25 08:39:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:52,207 INFO L472 AbstractCegarLoop]: Abstraction has 3231 states and 7541 transitions. [2018-07-25 08:39:52,207 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:39:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 7541 transitions. [2018-07-25 08:39:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:39:52,209 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:52,209 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:52,210 INFO L415 AbstractCegarLoop]: === Iteration 64 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:52,210 INFO L82 PathProgramCache]: Analyzing trace with hash 761893396, now seen corresponding path program 1 times [2018-07-25 08:39:52,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:52,221 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-25 08:39:52,221 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:52,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:39:52,222 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:39:52,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:39:52,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:39:52,222 INFO L87 Difference]: Start difference. First operand 3231 states and 7541 transitions. Second operand 11 states. [2018-07-25 08:39:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:57,688 INFO L93 Difference]: Finished difference Result 3973 states and 9077 transitions. [2018-07-25 08:39:57,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:39:57,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:39:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:57,692 INFO L225 Difference]: With dead ends: 3973 [2018-07-25 08:39:57,692 INFO L226 Difference]: Without dead ends: 3965 [2018-07-25 08:39:57,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:39:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2018-07-25 08:40:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3229. [2018-07-25 08:40:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2018-07-25 08:40:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 7508 transitions. [2018-07-25 08:40:01,774 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 7508 transitions. Word has length 20 [2018-07-25 08:40:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:01,774 INFO L472 AbstractCegarLoop]: Abstraction has 3229 states and 7508 transitions. [2018-07-25 08:40:01,774 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:40:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 7508 transitions. [2018-07-25 08:40:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:40:01,776 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:01,776 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:01,776 INFO L415 AbstractCegarLoop]: === Iteration 65 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -290904542, now seen corresponding path program 1 times [2018-07-25 08:40:01,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:01,786 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-25 08:40:01,786 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:01,786 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:40:01,787 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:40:01,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:40:01,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:40:01,787 INFO L87 Difference]: Start difference. First operand 3229 states and 7508 transitions. Second operand 11 states. [2018-07-25 08:40:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:07,653 INFO L93 Difference]: Finished difference Result 4093 states and 9363 transitions. [2018-07-25 08:40:07,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:40:07,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:40:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:07,658 INFO L225 Difference]: With dead ends: 4093 [2018-07-25 08:40:07,658 INFO L226 Difference]: Without dead ends: 4085 [2018-07-25 08:40:07,660 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:40:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2018-07-25 08:40:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3212. [2018-07-25 08:40:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2018-07-25 08:40:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 7460 transitions. [2018-07-25 08:40:11,749 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 7460 transitions. Word has length 20 [2018-07-25 08:40:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:11,750 INFO L472 AbstractCegarLoop]: Abstraction has 3212 states and 7460 transitions. [2018-07-25 08:40:11,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:40:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 7460 transitions. [2018-07-25 08:40:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:40:11,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:11,751 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:11,751 INFO L415 AbstractCegarLoop]: === Iteration 66 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 447453484, now seen corresponding path program 1 times [2018-07-25 08:40:11,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:11,761 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-25 08:40:11,761 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:40:11,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-07-25 08:40:11,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:40:11,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:40:11,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:40:11,762 INFO L87 Difference]: Start difference. First operand 3212 states and 7460 transitions. Second operand 11 states. [2018-07-25 08:40:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:18,261 INFO L93 Difference]: Finished difference Result 4634 states and 10636 transitions. [2018-07-25 08:40:18,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:40:18,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:40:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:18,266 INFO L225 Difference]: With dead ends: 4634 [2018-07-25 08:40:18,267 INFO L226 Difference]: Without dead ends: 4626 [2018-07-25 08:40:18,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:40:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2018-07-25 08:40:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 3219. [2018-07-25 08:40:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3219 states. [2018-07-25 08:40:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 7474 transitions. [2018-07-25 08:40:22,417 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 7474 transitions. Word has length 20 [2018-07-25 08:40:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:22,417 INFO L472 AbstractCegarLoop]: Abstraction has 3219 states and 7474 transitions. [2018-07-25 08:40:22,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:40:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 7474 transitions. [2018-07-25 08:40:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:40:22,419 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:22,419 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:22,419 INFO L415 AbstractCegarLoop]: === Iteration 67 === [productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 444653130, now seen corresponding path program 1 times [2018-07-25 08:40:22,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:22,430 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-25 08:40:22,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:22,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:40:22,431 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:40:22,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:40:22,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:40:22,431 INFO L87 Difference]: Start difference. First operand 3219 states and 7474 transitions. Second operand 11 states. Received shutdown request... [2018-07-25 08:40:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:40:22,483 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:40:22,490 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:40:22,491 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:40:22 BoogieIcfgContainer [2018-07-25 08:40:22,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:40:22,492 INFO L168 Benchmark]: Toolchain (without parser) took 252769.25 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -342.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-25 08:40:22,494 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-25 08:40:22,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.35 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-25 08:40:22,497 INFO L168 Benchmark]: Boogie Preprocessor took 59.56 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-25 08:40:22,497 INFO L168 Benchmark]: RCFGBuilder took 415.70 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-25 08:40:22,498 INFO L168 Benchmark]: TraceAbstraction took 252226.38 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -353.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-25 08:40:22,502 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.35 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 59.56 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 415.70 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 252226.38 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -353.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (3219states) and interpolant automaton (currently 4 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (14 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 252.1s OverallTime, 67 OverallIterations, 2 TraceHistogramMax, 157.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19172 SDtfs, 48799 SDslu, 66058 SDs, 0 SdLazy, 139790 SolverSat, 9892 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1880 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10911 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3231occurred in iteration=63, 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: 93.1s AutomataMinimizationTime, 66 MinimizatonAttempts, 37443 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1032 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 62375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 27 PerfectInterpolantSequences, 33/134 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_out.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-40-22-527.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-40-22-527.csv Completed graceful shutdown