java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:21:33,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:21:33,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:21:33,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:21:33,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:21:33,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:21:33,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:21:33,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:21:33,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:21:33,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:21:33,277 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:21:33,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:21:33,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:21:33,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:21:33,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:21:33,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:21:33,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:21:33,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:21:33,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:21:33,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:21:33,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:21:33,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:21:33,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:21:33,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:21:33,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:21:33,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:21:33,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:21:33,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:21:33,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:21:33,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:21:33,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:21:33,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:21:33,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:21:33,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:21:33,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:21:33,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:21:33,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:21:33,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:21:33,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:21:33,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:21:33,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:21:33,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:21:33,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:21:33,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:21:33,379 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:21:33,380 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:21:33,381 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2019-08-04 21:21:33,381 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2019-08-04 21:21:33,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:21:33,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:21:33,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:33,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:21:33,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:21:33,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,496 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:21:33,497 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:21:33,497 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:21:33,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:33,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:21:33,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:21:33,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:21:33,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... [2019-08-04 21:21:33,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:21:33,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:21:33,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:21:33,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:21:33,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:21:33,634 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-04 21:21:33,634 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-04 21:21:33,634 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-04 21:21:34,345 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-04 21:21:34,347 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:21:34,347 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:21:34,348 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:34 BoogieIcfgContainer [2019-08-04 21:21:34,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:21:34,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:21:34,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:21:34,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:21:34,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:33" (1/2) ... [2019-08-04 21:21:34,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a130bed and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:21:34, skipping insertion in model container [2019-08-04 21:21:34,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:34" (2/2) ... [2019-08-04 21:21:34,357 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2019-08-04 21:21:34,367 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:21:34,375 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-08-04 21:21:34,392 INFO L252 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-08-04 21:21:34,423 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:21:34,424 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:21:34,424 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:21:34,424 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:21:34,425 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:21:34,425 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:21:34,425 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:21:34,425 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:21:34,425 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:21:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-08-04 21:21:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:34,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:34,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:34,454 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2019-08-04 21:21:34,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:34,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:34,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:34,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:34,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:21:34,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:34,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:34,865 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2019-08-04 21:21:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:36,492 INFO L93 Difference]: Finished difference Result 158 states and 348 transitions. [2019-08-04 21:21:36,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:21:36,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-04 21:21:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:36,513 INFO L225 Difference]: With dead ends: 158 [2019-08-04 21:21:36,513 INFO L226 Difference]: Without dead ends: 158 [2019-08-04 21:21:36,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-04 21:21:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2019-08-04 21:21:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:21:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2019-08-04 21:21:36,561 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2019-08-04 21:21:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:36,562 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2019-08-04 21:21:36,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2019-08-04 21:21:36,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:36,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:36,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:36,564 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:36,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2019-08-04 21:21:36,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:36,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:21:36,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:36,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:36,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:21:36,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:36,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:36,812 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2019-08-04 21:21:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:37,586 INFO L93 Difference]: Finished difference Result 183 states and 408 transitions. [2019-08-04 21:21:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:21:37,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-04 21:21:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:37,590 INFO L225 Difference]: With dead ends: 183 [2019-08-04 21:21:37,591 INFO L226 Difference]: Without dead ends: 183 [2019-08-04 21:21:37,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-04 21:21:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2019-08-04 21:21:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-04 21:21:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2019-08-04 21:21:37,608 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2019-08-04 21:21:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:37,608 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2019-08-04 21:21:37,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2019-08-04 21:21:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:21:37,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:37,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:37,611 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2019-08-04 21:21:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:37,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:21:37,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:37,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:37,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:37,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:37,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:37,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:37,785 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2019-08-04 21:21:38,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:38,596 INFO L93 Difference]: Finished difference Result 222 states and 505 transitions. [2019-08-04 21:21:38,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:38,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-04 21:21:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:38,601 INFO L225 Difference]: With dead ends: 222 [2019-08-04 21:21:38,601 INFO L226 Difference]: Without dead ends: 222 [2019-08-04 21:21:38,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:21:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-04 21:21:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2019-08-04 21:21:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-04 21:21:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 304 transitions. [2019-08-04 21:21:38,615 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 304 transitions. Word has length 9 [2019-08-04 21:21:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:38,615 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 304 transitions. [2019-08-04 21:21:38,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 304 transitions. [2019-08-04 21:21:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:21:38,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:38,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:38,618 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2019-08-04 21:21:38,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:38,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:21:38,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:38,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:38,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-04 21:21:38,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:38,762 INFO L87 Difference]: Start difference. First operand 138 states and 304 transitions. Second operand 7 states. [2019-08-04 21:21:39,200 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-04 21:21:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:39,667 INFO L93 Difference]: Finished difference Result 213 states and 479 transitions. [2019-08-04 21:21:39,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:39,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-04 21:21:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:39,671 INFO L225 Difference]: With dead ends: 213 [2019-08-04 21:21:39,671 INFO L226 Difference]: Without dead ends: 213 [2019-08-04 21:21:39,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:21:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-04 21:21:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 159. [2019-08-04 21:21:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-04 21:21:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 351 transitions. [2019-08-04 21:21:39,683 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 351 transitions. Word has length 9 [2019-08-04 21:21:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:39,683 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 351 transitions. [2019-08-04 21:21:39,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 351 transitions. [2019-08-04 21:21:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:39,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:39,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:39,686 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2019-08-04 21:21:39,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:39,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:39,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:39,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:39,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:39,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:39,795 INFO L87 Difference]: Start difference. First operand 159 states and 351 transitions. Second operand 8 states. [2019-08-04 21:21:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:42,265 INFO L93 Difference]: Finished difference Result 798 states and 1815 transitions. [2019-08-04 21:21:42,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:21:42,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:42,274 INFO L225 Difference]: With dead ends: 798 [2019-08-04 21:21:42,274 INFO L226 Difference]: Without dead ends: 798 [2019-08-04 21:21:42,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:21:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-08-04 21:21:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 382. [2019-08-04 21:21:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-04 21:21:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 912 transitions. [2019-08-04 21:21:42,307 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 912 transitions. Word has length 12 [2019-08-04 21:21:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:42,307 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 912 transitions. [2019-08-04 21:21:42,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 912 transitions. [2019-08-04 21:21:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:42,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:42,310 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:42,310 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2019-08-04 21:21:42,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:42,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:42,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:42,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:42,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:42,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:42,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:42,411 INFO L87 Difference]: Start difference. First operand 382 states and 912 transitions. Second operand 8 states. [2019-08-04 21:21:47,728 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-04 21:21:48,609 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-04 21:21:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:48,833 INFO L93 Difference]: Finished difference Result 921 states and 2086 transitions. [2019-08-04 21:21:48,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:21:48,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:48,840 INFO L225 Difference]: With dead ends: 921 [2019-08-04 21:21:48,840 INFO L226 Difference]: Without dead ends: 921 [2019-08-04 21:21:48,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:21:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-08-04 21:21:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 388. [2019-08-04 21:21:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-04 21:21:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 924 transitions. [2019-08-04 21:21:48,858 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 924 transitions. Word has length 12 [2019-08-04 21:21:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:48,859 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 924 transitions. [2019-08-04 21:21:48,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 924 transitions. [2019-08-04 21:21:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:48,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:48,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:48,862 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2019-08-04 21:21:48,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:48,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:48,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:48,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:48,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:48,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:48,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:48,950 INFO L87 Difference]: Start difference. First operand 388 states and 924 transitions. Second operand 8 states. [2019-08-04 21:21:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:51,080 INFO L93 Difference]: Finished difference Result 817 states and 1840 transitions. [2019-08-04 21:21:51,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:21:51,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:51,087 INFO L225 Difference]: With dead ends: 817 [2019-08-04 21:21:51,087 INFO L226 Difference]: Without dead ends: 817 [2019-08-04 21:21:51,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:21:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-08-04 21:21:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 416. [2019-08-04 21:21:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-08-04 21:21:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1000 transitions. [2019-08-04 21:21:51,103 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1000 transitions. Word has length 12 [2019-08-04 21:21:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:51,104 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 1000 transitions. [2019-08-04 21:21:51,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1000 transitions. [2019-08-04 21:21:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:51,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:51,106 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:51,106 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2019-08-04 21:21:51,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:51,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:51,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:51,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:51,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:51,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:51,185 INFO L87 Difference]: Start difference. First operand 416 states and 1000 transitions. Second operand 8 states. [2019-08-04 21:21:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:52,634 INFO L93 Difference]: Finished difference Result 666 states and 1511 transitions. [2019-08-04 21:21:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:21:52,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:52,640 INFO L225 Difference]: With dead ends: 666 [2019-08-04 21:21:52,640 INFO L226 Difference]: Without dead ends: 666 [2019-08-04 21:21:52,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:21:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-08-04 21:21:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 422. [2019-08-04 21:21:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-04 21:21:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1004 transitions. [2019-08-04 21:21:52,653 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1004 transitions. Word has length 12 [2019-08-04 21:21:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:52,654 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 1004 transitions. [2019-08-04 21:21:52,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1004 transitions. [2019-08-04 21:21:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:52,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:52,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:52,656 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:52,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2019-08-04 21:21:52,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:52,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:52,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:52,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:52,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:52,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:52,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:52,791 INFO L87 Difference]: Start difference. First operand 422 states and 1004 transitions. Second operand 8 states. [2019-08-04 21:21:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:55,016 INFO L93 Difference]: Finished difference Result 1103 states and 2507 transitions. [2019-08-04 21:21:55,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:21:55,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:55,024 INFO L225 Difference]: With dead ends: 1103 [2019-08-04 21:21:55,024 INFO L226 Difference]: Without dead ends: 1103 [2019-08-04 21:21:55,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:21:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-08-04 21:21:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 434. [2019-08-04 21:21:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-08-04 21:21:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1032 transitions. [2019-08-04 21:21:55,041 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1032 transitions. Word has length 12 [2019-08-04 21:21:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:55,042 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 1032 transitions. [2019-08-04 21:21:55,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1032 transitions. [2019-08-04 21:21:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:55,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:55,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:55,043 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2019-08-04 21:21:55,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:55,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:55,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:55,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:55,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:55,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:55,125 INFO L87 Difference]: Start difference. First operand 434 states and 1032 transitions. Second operand 8 states. [2019-08-04 21:21:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:57,402 INFO L93 Difference]: Finished difference Result 1091 states and 2447 transitions. [2019-08-04 21:21:57,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:21:57,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:57,410 INFO L225 Difference]: With dead ends: 1091 [2019-08-04 21:21:57,411 INFO L226 Difference]: Without dead ends: 1091 [2019-08-04 21:21:57,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:21:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-08-04 21:21:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 462. [2019-08-04 21:21:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-04 21:21:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1108 transitions. [2019-08-04 21:21:57,427 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1108 transitions. Word has length 12 [2019-08-04 21:21:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:57,428 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 1108 transitions. [2019-08-04 21:21:57,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1108 transitions. [2019-08-04 21:21:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:57,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:57,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:57,431 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:57,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2019-08-04 21:21:57,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:57,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:57,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:57,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:57,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:57,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:57,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:57,544 INFO L87 Difference]: Start difference. First operand 462 states and 1108 transitions. Second operand 8 states. [2019-08-04 21:21:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:59,280 INFO L93 Difference]: Finished difference Result 933 states and 2102 transitions. [2019-08-04 21:21:59,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:21:59,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:21:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:59,287 INFO L225 Difference]: With dead ends: 933 [2019-08-04 21:21:59,287 INFO L226 Difference]: Without dead ends: 933 [2019-08-04 21:21:59,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:21:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-08-04 21:21:59,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 428. [2019-08-04 21:21:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-08-04 21:21:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1020 transitions. [2019-08-04 21:21:59,301 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1020 transitions. Word has length 12 [2019-08-04 21:21:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:59,302 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 1020 transitions. [2019-08-04 21:21:59,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:21:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1020 transitions. [2019-08-04 21:21:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:21:59,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:59,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:59,303 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:59,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2019-08-04 21:21:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:59,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:21:59,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:59,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:59,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:21:59,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:21:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:21:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:21:59,489 INFO L87 Difference]: Start difference. First operand 428 states and 1020 transitions. Second operand 8 states. [2019-08-04 21:22:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:01,558 INFO L93 Difference]: Finished difference Result 1016 states and 2300 transitions. [2019-08-04 21:22:01,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:22:01,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:01,564 INFO L225 Difference]: With dead ends: 1016 [2019-08-04 21:22:01,565 INFO L226 Difference]: Without dead ends: 1016 [2019-08-04 21:22:01,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:22:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-08-04 21:22:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 474. [2019-08-04 21:22:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-08-04 21:22:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1152 transitions. [2019-08-04 21:22:01,579 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1152 transitions. Word has length 12 [2019-08-04 21:22:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:01,580 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 1152 transitions. [2019-08-04 21:22:01,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1152 transitions. [2019-08-04 21:22:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:01,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:01,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:01,582 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:01,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2019-08-04 21:22:01,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:01,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:01,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:01,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:01,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:01,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:01,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:01,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:01,874 INFO L87 Difference]: Start difference. First operand 474 states and 1152 transitions. Second operand 8 states. [2019-08-04 21:22:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:03,644 INFO L93 Difference]: Finished difference Result 919 states and 2083 transitions. [2019-08-04 21:22:03,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:03,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:03,650 INFO L225 Difference]: With dead ends: 919 [2019-08-04 21:22:03,650 INFO L226 Difference]: Without dead ends: 919 [2019-08-04 21:22:03,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-08-04 21:22:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 462. [2019-08-04 21:22:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-04 21:22:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1122 transitions. [2019-08-04 21:22:03,662 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1122 transitions. Word has length 12 [2019-08-04 21:22:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:03,662 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 1122 transitions. [2019-08-04 21:22:03,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1122 transitions. [2019-08-04 21:22:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:03,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:03,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:03,664 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2019-08-04 21:22:03,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:03,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:03,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:03,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:03,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:03,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:03,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:03,781 INFO L87 Difference]: Start difference. First operand 462 states and 1122 transitions. Second operand 8 states. [2019-08-04 21:22:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:05,414 INFO L93 Difference]: Finished difference Result 945 states and 2174 transitions. [2019-08-04 21:22:05,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:22:05,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:05,419 INFO L225 Difference]: With dead ends: 945 [2019-08-04 21:22:05,419 INFO L226 Difference]: Without dead ends: 945 [2019-08-04 21:22:05,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:22:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-08-04 21:22:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 483. [2019-08-04 21:22:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-08-04 21:22:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1177 transitions. [2019-08-04 21:22:05,431 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1177 transitions. Word has length 12 [2019-08-04 21:22:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:05,432 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 1177 transitions. [2019-08-04 21:22:05,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1177 transitions. [2019-08-04 21:22:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:05,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:05,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:05,434 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2019-08-04 21:22:05,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:05,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:05,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:05,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:05,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:05,587 INFO L87 Difference]: Start difference. First operand 483 states and 1177 transitions. Second operand 8 states. [2019-08-04 21:22:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:07,216 INFO L93 Difference]: Finished difference Result 1169 states and 2718 transitions. [2019-08-04 21:22:07,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:22:07,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:07,224 INFO L225 Difference]: With dead ends: 1169 [2019-08-04 21:22:07,224 INFO L226 Difference]: Without dead ends: 1169 [2019-08-04 21:22:07,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:22:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-08-04 21:22:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 697. [2019-08-04 21:22:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-08-04 21:22:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1710 transitions. [2019-08-04 21:22:07,240 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1710 transitions. Word has length 12 [2019-08-04 21:22:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:07,240 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1710 transitions. [2019-08-04 21:22:07,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1710 transitions. [2019-08-04 21:22:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:07,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:07,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:07,242 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2019-08-04 21:22:07,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:07,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:07,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:07,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:07,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:07,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:07,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:07,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:07,345 INFO L87 Difference]: Start difference. First operand 697 states and 1710 transitions. Second operand 8 states. [2019-08-04 21:22:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:09,060 INFO L93 Difference]: Finished difference Result 1231 states and 2836 transitions. [2019-08-04 21:22:09,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:09,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:09,066 INFO L225 Difference]: With dead ends: 1231 [2019-08-04 21:22:09,066 INFO L226 Difference]: Without dead ends: 1231 [2019-08-04 21:22:09,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2019-08-04 21:22:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 709. [2019-08-04 21:22:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-08-04 21:22:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1740 transitions. [2019-08-04 21:22:09,081 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1740 transitions. Word has length 12 [2019-08-04 21:22:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:09,081 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1740 transitions. [2019-08-04 21:22:09,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1740 transitions. [2019-08-04 21:22:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:09,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:09,082 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:09,083 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:09,083 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2019-08-04 21:22:09,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:09,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:09,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:09,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:09,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:09,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:09,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:09,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:09,396 INFO L87 Difference]: Start difference. First operand 709 states and 1740 transitions. Second operand 8 states. [2019-08-04 21:22:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:11,470 INFO L93 Difference]: Finished difference Result 1376 states and 3224 transitions. [2019-08-04 21:22:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:22:11,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:11,478 INFO L225 Difference]: With dead ends: 1376 [2019-08-04 21:22:11,478 INFO L226 Difference]: Without dead ends: 1376 [2019-08-04 21:22:11,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:22:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-08-04 21:22:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 756. [2019-08-04 21:22:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-08-04 21:22:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1867 transitions. [2019-08-04 21:22:11,493 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1867 transitions. Word has length 12 [2019-08-04 21:22:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:11,494 INFO L475 AbstractCegarLoop]: Abstraction has 756 states and 1867 transitions. [2019-08-04 21:22:11,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1867 transitions. [2019-08-04 21:22:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:11,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:11,495 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:11,495 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2019-08-04 21:22:11,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:11,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:11,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:11,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:11,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:11,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:11,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:11,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:11,567 INFO L87 Difference]: Start difference. First operand 756 states and 1867 transitions. Second operand 8 states. [2019-08-04 21:22:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:13,121 INFO L93 Difference]: Finished difference Result 1294 states and 2987 transitions. [2019-08-04 21:22:13,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:22:13,122 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:13,129 INFO L225 Difference]: With dead ends: 1294 [2019-08-04 21:22:13,129 INFO L226 Difference]: Without dead ends: 1294 [2019-08-04 21:22:13,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-08-04 21:22:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 799. [2019-08-04 21:22:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-08-04 21:22:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1966 transitions. [2019-08-04 21:22:13,145 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1966 transitions. Word has length 12 [2019-08-04 21:22:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:13,145 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1966 transitions. [2019-08-04 21:22:13,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1966 transitions. [2019-08-04 21:22:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:13,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:13,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:13,147 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2019-08-04 21:22:13,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:13,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:13,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:13,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:13,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:13,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:13,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:13,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:13,265 INFO L87 Difference]: Start difference. First operand 799 states and 1966 transitions. Second operand 8 states. [2019-08-04 21:22:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:15,554 INFO L93 Difference]: Finished difference Result 1532 states and 3571 transitions. [2019-08-04 21:22:15,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:22:15,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:15,568 INFO L225 Difference]: With dead ends: 1532 [2019-08-04 21:22:15,569 INFO L226 Difference]: Without dead ends: 1532 [2019-08-04 21:22:15,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:22:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-08-04 21:22:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 762. [2019-08-04 21:22:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-08-04 21:22:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1879 transitions. [2019-08-04 21:22:15,587 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1879 transitions. Word has length 12 [2019-08-04 21:22:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:15,587 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1879 transitions. [2019-08-04 21:22:15,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1879 transitions. [2019-08-04 21:22:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:15,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:15,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:15,589 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:15,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2019-08-04 21:22:15,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:15,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:15,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:15,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:15,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:15,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:15,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:15,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:15,696 INFO L87 Difference]: Start difference. First operand 762 states and 1879 transitions. Second operand 8 states. [2019-08-04 21:22:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:18,177 INFO L93 Difference]: Finished difference Result 1485 states and 3491 transitions. [2019-08-04 21:22:18,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:22:18,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:18,187 INFO L225 Difference]: With dead ends: 1485 [2019-08-04 21:22:18,187 INFO L226 Difference]: Without dead ends: 1485 [2019-08-04 21:22:18,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:22:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-08-04 21:22:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 780. [2019-08-04 21:22:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-08-04 21:22:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1919 transitions. [2019-08-04 21:22:18,205 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1919 transitions. Word has length 12 [2019-08-04 21:22:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:18,205 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1919 transitions. [2019-08-04 21:22:18,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1919 transitions. [2019-08-04 21:22:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:18,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:18,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:18,207 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:18,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:18,207 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2019-08-04 21:22:18,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:18,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:18,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:18,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:18,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:18,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:18,285 INFO L87 Difference]: Start difference. First operand 780 states and 1919 transitions. Second operand 8 states. [2019-08-04 21:22:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:19,669 INFO L93 Difference]: Finished difference Result 1058 states and 2483 transitions. [2019-08-04 21:22:19,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:22:19,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:19,676 INFO L225 Difference]: With dead ends: 1058 [2019-08-04 21:22:19,676 INFO L226 Difference]: Without dead ends: 1058 [2019-08-04 21:22:19,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-08-04 21:22:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 783. [2019-08-04 21:22:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-08-04 21:22:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1927 transitions. [2019-08-04 21:22:19,708 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1927 transitions. Word has length 12 [2019-08-04 21:22:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:19,708 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1927 transitions. [2019-08-04 21:22:19,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1927 transitions. [2019-08-04 21:22:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:19,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:19,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:19,710 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2019-08-04 21:22:19,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:19,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:19,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:19,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:19,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:19,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:19,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:19,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:19,786 INFO L87 Difference]: Start difference. First operand 783 states and 1927 transitions. Second operand 8 states. [2019-08-04 21:22:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:21,568 INFO L93 Difference]: Finished difference Result 1295 states and 3071 transitions. [2019-08-04 21:22:21,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:22:21,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:21,576 INFO L225 Difference]: With dead ends: 1295 [2019-08-04 21:22:21,576 INFO L226 Difference]: Without dead ends: 1295 [2019-08-04 21:22:21,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:22:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-08-04 21:22:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 746. [2019-08-04 21:22:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-08-04 21:22:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1840 transitions. [2019-08-04 21:22:21,592 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1840 transitions. Word has length 12 [2019-08-04 21:22:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:21,592 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1840 transitions. [2019-08-04 21:22:21,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1840 transitions. [2019-08-04 21:22:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:21,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:21,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:21,594 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2019-08-04 21:22:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:21,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:21,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:21,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:21,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:21,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:21,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:21,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:21,700 INFO L87 Difference]: Start difference. First operand 746 states and 1840 transitions. Second operand 8 states. [2019-08-04 21:22:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:23,891 INFO L93 Difference]: Finished difference Result 1428 states and 3394 transitions. [2019-08-04 21:22:23,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:22:23,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:23,895 INFO L225 Difference]: With dead ends: 1428 [2019-08-04 21:22:23,895 INFO L226 Difference]: Without dead ends: 1428 [2019-08-04 21:22:23,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:22:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-08-04 21:22:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 740. [2019-08-04 21:22:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-08-04 21:22:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1828 transitions. [2019-08-04 21:22:23,909 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1828 transitions. Word has length 12 [2019-08-04 21:22:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:23,909 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 1828 transitions. [2019-08-04 21:22:23,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1828 transitions. [2019-08-04 21:22:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:22:23,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:23,910 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:23,911 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2019-08-04 21:22:23,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:23,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:22:23,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:23,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:23,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-04 21:22:23,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:23,970 INFO L87 Difference]: Start difference. First operand 740 states and 1828 transitions. Second operand 8 states. [2019-08-04 21:22:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:25,575 INFO L93 Difference]: Finished difference Result 1450 states and 3475 transitions. [2019-08-04 21:22:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:22:25,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-04 21:22:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:25,580 INFO L225 Difference]: With dead ends: 1450 [2019-08-04 21:22:25,580 INFO L226 Difference]: Without dead ends: 1450 [2019-08-04 21:22:25,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:22:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-08-04 21:22:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2019-08-04 21:22:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-08-04 21:22:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1959 transitions. [2019-08-04 21:22:25,591 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1959 transitions. Word has length 12 [2019-08-04 21:22:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:25,592 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1959 transitions. [2019-08-04 21:22:25,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1959 transitions. [2019-08-04 21:22:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:25,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:25,593 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:25,593 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:25,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash -987625651, now seen corresponding path program 1 times [2019-08-04 21:22:25,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:25,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:25,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:25,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:25,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:25,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:25,696 INFO L87 Difference]: Start difference. First operand 795 states and 1959 transitions. Second operand 10 states. [2019-08-04 21:22:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:26,782 INFO L93 Difference]: Finished difference Result 1372 states and 3343 transitions. [2019-08-04 21:22:26,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:22:26,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:26,786 INFO L225 Difference]: With dead ends: 1372 [2019-08-04 21:22:26,786 INFO L226 Difference]: Without dead ends: 1372 [2019-08-04 21:22:26,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-08-04 21:22:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 512. [2019-08-04 21:22:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-08-04 21:22:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1246 transitions. [2019-08-04 21:22:26,801 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1246 transitions. Word has length 16 [2019-08-04 21:22:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:26,801 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 1246 transitions. [2019-08-04 21:22:26,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1246 transitions. [2019-08-04 21:22:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:26,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:26,802 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:26,803 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:26,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1922316245, now seen corresponding path program 1 times [2019-08-04 21:22:26,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:26,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:26,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:27,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:27,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:27,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:27,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:27,088 INFO L87 Difference]: Start difference. First operand 512 states and 1246 transitions. Second operand 10 states. [2019-08-04 21:22:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:28,746 INFO L93 Difference]: Finished difference Result 1513 states and 3652 transitions. [2019-08-04 21:22:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:22:28,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:28,751 INFO L225 Difference]: With dead ends: 1513 [2019-08-04 21:22:28,751 INFO L226 Difference]: Without dead ends: 1513 [2019-08-04 21:22:28,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=614, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:22:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-08-04 21:22:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 515. [2019-08-04 21:22:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-08-04 21:22:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1252 transitions. [2019-08-04 21:22:28,765 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1252 transitions. Word has length 16 [2019-08-04 21:22:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:28,765 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 1252 transitions. [2019-08-04 21:22:28,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1252 transitions. [2019-08-04 21:22:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:28,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:28,766 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:28,767 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:28,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1925116599, now seen corresponding path program 1 times [2019-08-04 21:22:28,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:28,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:28,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:29,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:29,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:29,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:29,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:29,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:29,191 INFO L87 Difference]: Start difference. First operand 515 states and 1252 transitions. Second operand 10 states. [2019-08-04 21:22:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:30,690 INFO L93 Difference]: Finished difference Result 1288 states and 3088 transitions. [2019-08-04 21:22:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:22:30,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:30,694 INFO L225 Difference]: With dead ends: 1288 [2019-08-04 21:22:30,694 INFO L226 Difference]: Without dead ends: 1288 [2019-08-04 21:22:30,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:22:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-08-04 21:22:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 542. [2019-08-04 21:22:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-08-04 21:22:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1332 transitions. [2019-08-04 21:22:30,705 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1332 transitions. Word has length 16 [2019-08-04 21:22:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:30,705 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 1332 transitions. [2019-08-04 21:22:30,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1332 transitions. [2019-08-04 21:22:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:30,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:30,706 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:30,706 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1925014454, now seen corresponding path program 1 times [2019-08-04 21:22:30,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:30,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:30,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:30,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:30,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:30,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:30,774 INFO L87 Difference]: Start difference. First operand 542 states and 1332 transitions. Second operand 10 states. [2019-08-04 21:22:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:31,819 INFO L93 Difference]: Finished difference Result 888 states and 2108 transitions. [2019-08-04 21:22:31,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:31,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:31,821 INFO L225 Difference]: With dead ends: 888 [2019-08-04 21:22:31,821 INFO L226 Difference]: Without dead ends: 888 [2019-08-04 21:22:31,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:22:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-08-04 21:22:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 532. [2019-08-04 21:22:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-08-04 21:22:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1291 transitions. [2019-08-04 21:22:31,829 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1291 transitions. Word has length 16 [2019-08-04 21:22:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:31,829 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 1291 transitions. [2019-08-04 21:22:31,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1291 transitions. [2019-08-04 21:22:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:31,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:31,830 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:31,831 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash 91368871, now seen corresponding path program 1 times [2019-08-04 21:22:31,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:31,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:31,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:31,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:31,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:31,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:31,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:31,953 INFO L87 Difference]: Start difference. First operand 532 states and 1291 transitions. Second operand 10 states. [2019-08-04 21:22:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:34,311 INFO L93 Difference]: Finished difference Result 1180 states and 2742 transitions. [2019-08-04 21:22:34,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:22:34,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:34,316 INFO L225 Difference]: With dead ends: 1180 [2019-08-04 21:22:34,316 INFO L226 Difference]: Without dead ends: 1180 [2019-08-04 21:22:34,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:22:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-08-04 21:22:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 510. [2019-08-04 21:22:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-08-04 21:22:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1241 transitions. [2019-08-04 21:22:34,329 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1241 transitions. Word has length 16 [2019-08-04 21:22:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:34,329 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 1241 transitions. [2019-08-04 21:22:34,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1241 transitions. [2019-08-04 21:22:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:34,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:34,331 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:34,331 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash 88568517, now seen corresponding path program 1 times [2019-08-04 21:22:34,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:34,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:34,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:34,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:34,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:34,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:34,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:34,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:34,563 INFO L87 Difference]: Start difference. First operand 510 states and 1241 transitions. Second operand 10 states. [2019-08-04 21:22:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:36,939 INFO L93 Difference]: Finished difference Result 1224 states and 2825 transitions. [2019-08-04 21:22:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:22:36,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:36,944 INFO L225 Difference]: With dead ends: 1224 [2019-08-04 21:22:36,944 INFO L226 Difference]: Without dead ends: 1224 [2019-08-04 21:22:36,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:22:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-08-04 21:22:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 537. [2019-08-04 21:22:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-08-04 21:22:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1321 transitions. [2019-08-04 21:22:36,953 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1321 transitions. Word has length 16 [2019-08-04 21:22:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:36,954 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 1321 transitions. [2019-08-04 21:22:36,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1321 transitions. [2019-08-04 21:22:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:36,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:36,954 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:36,955 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash 88670662, now seen corresponding path program 1 times [2019-08-04 21:22:36,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:36,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:36,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:37,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:37,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:37,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:37,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:37,128 INFO L87 Difference]: Start difference. First operand 537 states and 1321 transitions. Second operand 10 states. [2019-08-04 21:22:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:39,176 INFO L93 Difference]: Finished difference Result 957 states and 2203 transitions. [2019-08-04 21:22:39,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:39,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:39,178 INFO L225 Difference]: With dead ends: 957 [2019-08-04 21:22:39,178 INFO L226 Difference]: Without dead ends: 957 [2019-08-04 21:22:39,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:22:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-08-04 21:22:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 507. [2019-08-04 21:22:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-08-04 21:22:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1235 transitions. [2019-08-04 21:22:39,187 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1235 transitions. Word has length 16 [2019-08-04 21:22:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:39,187 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 1235 transitions. [2019-08-04 21:22:39,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1235 transitions. [2019-08-04 21:22:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:39,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:39,188 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:39,188 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash 385942279, now seen corresponding path program 1 times [2019-08-04 21:22:39,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:39,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:39,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:39,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:39,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:39,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:39,311 INFO L87 Difference]: Start difference. First operand 507 states and 1235 transitions. Second operand 10 states. [2019-08-04 21:22:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:41,492 INFO L93 Difference]: Finished difference Result 1054 states and 2437 transitions. [2019-08-04 21:22:41,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:41,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:41,494 INFO L225 Difference]: With dead ends: 1054 [2019-08-04 21:22:41,495 INFO L226 Difference]: Without dead ends: 1054 [2019-08-04 21:22:41,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:22:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2019-08-04 21:22:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 444. [2019-08-04 21:22:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-08-04 21:22:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1067 transitions. [2019-08-04 21:22:41,506 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1067 transitions. Word has length 16 [2019-08-04 21:22:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:41,506 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 1067 transitions. [2019-08-04 21:22:41,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1067 transitions. [2019-08-04 21:22:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:41,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:41,507 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:41,507 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash 386044424, now seen corresponding path program 1 times [2019-08-04 21:22:41,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:41,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:41,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:41,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:41,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:41,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:41,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:41,580 INFO L87 Difference]: Start difference. First operand 444 states and 1067 transitions. Second operand 10 states. [2019-08-04 21:22:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:43,483 INFO L93 Difference]: Finished difference Result 877 states and 2008 transitions. [2019-08-04 21:22:43,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:43,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:43,486 INFO L225 Difference]: With dead ends: 877 [2019-08-04 21:22:43,486 INFO L226 Difference]: Without dead ends: 877 [2019-08-04 21:22:43,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:22:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-08-04 21:22:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 438. [2019-08-04 21:22:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-08-04 21:22:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1052 transitions. [2019-08-04 21:22:43,496 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1052 transitions. Word has length 16 [2019-08-04 21:22:43,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:43,496 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 1052 transitions. [2019-08-04 21:22:43,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1052 transitions. [2019-08-04 21:22:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:43,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:43,497 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:43,497 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:43,497 INFO L82 PathProgramCache]: Analyzing trace with hash 394958660, now seen corresponding path program 1 times [2019-08-04 21:22:43,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:43,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:43,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:43,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:43,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:43,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:43,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:43,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:43,686 INFO L87 Difference]: Start difference. First operand 438 states and 1052 transitions. Second operand 10 states. [2019-08-04 21:22:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:45,575 INFO L93 Difference]: Finished difference Result 797 states and 1847 transitions. [2019-08-04 21:22:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:45,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:45,577 INFO L225 Difference]: With dead ends: 797 [2019-08-04 21:22:45,577 INFO L226 Difference]: Without dead ends: 797 [2019-08-04 21:22:45,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-08-04 21:22:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 298. [2019-08-04 21:22:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-08-04 21:22:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 699 transitions. [2019-08-04 21:22:45,584 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 699 transitions. Word has length 16 [2019-08-04 21:22:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:45,585 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 699 transitions. [2019-08-04 21:22:45,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 699 transitions. [2019-08-04 21:22:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:45,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:45,585 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:45,586 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -884179606, now seen corresponding path program 1 times [2019-08-04 21:22:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:45,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:45,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:45,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:45,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:45,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:45,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:45,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:45,726 INFO L87 Difference]: Start difference. First operand 298 states and 699 transitions. Second operand 10 states. [2019-08-04 21:22:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:47,623 INFO L93 Difference]: Finished difference Result 583 states and 1322 transitions. [2019-08-04 21:22:47,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:47,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:47,625 INFO L225 Difference]: With dead ends: 583 [2019-08-04 21:22:47,625 INFO L226 Difference]: Without dead ends: 583 [2019-08-04 21:22:47,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-08-04 21:22:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 287. [2019-08-04 21:22:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-08-04 21:22:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 665 transitions. [2019-08-04 21:22:47,630 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 665 transitions. Word has length 16 [2019-08-04 21:22:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:47,630 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 665 transitions. [2019-08-04 21:22:47,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 665 transitions. [2019-08-04 21:22:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:47,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:47,631 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:47,631 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash -886878094, now seen corresponding path program 1 times [2019-08-04 21:22:47,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:47,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:47,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:47,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:47,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:47,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:47,693 INFO L87 Difference]: Start difference. First operand 287 states and 665 transitions. Second operand 10 states. [2019-08-04 21:22:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:49,788 INFO L93 Difference]: Finished difference Result 619 states and 1366 transitions. [2019-08-04 21:22:49,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:49,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:49,789 INFO L225 Difference]: With dead ends: 619 [2019-08-04 21:22:49,789 INFO L226 Difference]: Without dead ends: 619 [2019-08-04 21:22:49,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:22:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-08-04 21:22:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 291. [2019-08-04 21:22:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-04 21:22:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 675 transitions. [2019-08-04 21:22:49,795 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 675 transitions. Word has length 16 [2019-08-04 21:22:49,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:49,795 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 675 transitions. [2019-08-04 21:22:49,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 675 transitions. [2019-08-04 21:22:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:49,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:49,796 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:49,796 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash -886877815, now seen corresponding path program 1 times [2019-08-04 21:22:49,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:49,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:49,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:49,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:49,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:49,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:49,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:49,859 INFO L87 Difference]: Start difference. First operand 291 states and 675 transitions. Second operand 10 states. [2019-08-04 21:22:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:52,245 INFO L93 Difference]: Finished difference Result 665 states and 1507 transitions. [2019-08-04 21:22:52,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:52,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:52,247 INFO L225 Difference]: With dead ends: 665 [2019-08-04 21:22:52,247 INFO L226 Difference]: Without dead ends: 665 [2019-08-04 21:22:52,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:22:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-08-04 21:22:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 257. [2019-08-04 21:22:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-04 21:22:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 588 transitions. [2019-08-04 21:22:52,252 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 588 transitions. Word has length 16 [2019-08-04 21:22:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:52,253 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 588 transitions. [2019-08-04 21:22:52,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 588 transitions. [2019-08-04 21:22:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:52,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:52,253 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:52,254 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:52,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:52,254 INFO L82 PathProgramCache]: Analyzing trace with hash 344711637, now seen corresponding path program 1 times [2019-08-04 21:22:52,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:52,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:52,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:52,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:52,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:52,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:52,387 INFO L87 Difference]: Start difference. First operand 257 states and 588 transitions. Second operand 10 states. [2019-08-04 21:22:53,974 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-08-04 21:22:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:55,034 INFO L93 Difference]: Finished difference Result 634 states and 1404 transitions. [2019-08-04 21:22:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:22:55,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:55,036 INFO L225 Difference]: With dead ends: 634 [2019-08-04 21:22:55,036 INFO L226 Difference]: Without dead ends: 634 [2019-08-04 21:22:55,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:22:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-08-04 21:22:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 277. [2019-08-04 21:22:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-04 21:22:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 633 transitions. [2019-08-04 21:22:55,042 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 633 transitions. Word has length 16 [2019-08-04 21:22:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:55,042 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 633 transitions. [2019-08-04 21:22:55,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 633 transitions. [2019-08-04 21:22:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:55,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:55,042 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:55,043 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:55,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:55,043 INFO L82 PathProgramCache]: Analyzing trace with hash 344711916, now seen corresponding path program 1 times [2019-08-04 21:22:55,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:55,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:55,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:55,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:55,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:55,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:55,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:55,102 INFO L87 Difference]: Start difference. First operand 277 states and 633 transitions. Second operand 10 states. [2019-08-04 21:22:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:57,594 INFO L93 Difference]: Finished difference Result 728 states and 1636 transitions. [2019-08-04 21:22:57,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:22:57,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:22:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:57,596 INFO L225 Difference]: With dead ends: 728 [2019-08-04 21:22:57,596 INFO L226 Difference]: Without dead ends: 728 [2019-08-04 21:22:57,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:22:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-08-04 21:22:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 259. [2019-08-04 21:22:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-04 21:22:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 592 transitions. [2019-08-04 21:22:57,603 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 592 transitions. Word has length 16 [2019-08-04 21:22:57,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:57,603 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 592 transitions. [2019-08-04 21:22:57,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:57,603 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 592 transitions. [2019-08-04 21:22:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:22:57,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:57,603 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:57,604 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash 348591473, now seen corresponding path program 1 times [2019-08-04 21:22:57,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:57,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:22:57,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:57,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:57,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:57,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:57,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:57,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:57,672 INFO L87 Difference]: Start difference. First operand 259 states and 592 transitions. Second operand 10 states. [2019-08-04 21:23:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:00,257 INFO L93 Difference]: Finished difference Result 705 states and 1605 transitions. [2019-08-04 21:23:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:23:00,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:00,259 INFO L225 Difference]: With dead ends: 705 [2019-08-04 21:23:00,259 INFO L226 Difference]: Without dead ends: 705 [2019-08-04 21:23:00,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:23:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-08-04 21:23:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 253. [2019-08-04 21:23:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-04 21:23:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 578 transitions. [2019-08-04 21:23:00,266 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 578 transitions. Word has length 16 [2019-08-04 21:23:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:00,266 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 578 transitions. [2019-08-04 21:23:00,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 578 transitions. [2019-08-04 21:23:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:00,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:00,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:00,267 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -353600118, now seen corresponding path program 1 times [2019-08-04 21:23:00,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:00,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:00,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:00,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:00,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:00,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:00,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:00,319 INFO L87 Difference]: Start difference. First operand 253 states and 578 transitions. Second operand 10 states. [2019-08-04 21:23:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:01,838 INFO L93 Difference]: Finished difference Result 518 states and 1169 transitions. [2019-08-04 21:23:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:23:01,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:01,839 INFO L225 Difference]: With dead ends: 518 [2019-08-04 21:23:01,840 INFO L226 Difference]: Without dead ends: 518 [2019-08-04 21:23:01,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:23:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-08-04 21:23:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 253. [2019-08-04 21:23:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-04 21:23:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 578 transitions. [2019-08-04 21:23:01,845 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 578 transitions. Word has length 16 [2019-08-04 21:23:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:01,845 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 578 transitions. [2019-08-04 21:23:01,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 578 transitions. [2019-08-04 21:23:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:01,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:01,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:01,846 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:01,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash -353599839, now seen corresponding path program 1 times [2019-08-04 21:23:01,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:01,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:01,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:01,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:01,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:01,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:01,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:01,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:01,902 INFO L87 Difference]: Start difference. First operand 253 states and 578 transitions. Second operand 10 states. [2019-08-04 21:23:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:04,116 INFO L93 Difference]: Finished difference Result 663 states and 1513 transitions. [2019-08-04 21:23:04,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:23:04,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:04,123 INFO L225 Difference]: With dead ends: 663 [2019-08-04 21:23:04,123 INFO L226 Difference]: Without dead ends: 663 [2019-08-04 21:23:04,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=745, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:23:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-08-04 21:23:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 235. [2019-08-04 21:23:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-08-04 21:23:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 537 transitions. [2019-08-04 21:23:04,128 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 537 transitions. Word has length 16 [2019-08-04 21:23:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:04,128 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 537 transitions. [2019-08-04 21:23:04,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 537 transitions. [2019-08-04 21:23:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:04,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:04,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:04,129 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:04,129 INFO L82 PathProgramCache]: Analyzing trace with hash -349720282, now seen corresponding path program 1 times [2019-08-04 21:23:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:04,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:04,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:04,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:04,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:04,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:04,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:04,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:04,371 INFO L87 Difference]: Start difference. First operand 235 states and 537 transitions. Second operand 10 states. [2019-08-04 21:23:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:07,026 INFO L93 Difference]: Finished difference Result 692 states and 1586 transitions. [2019-08-04 21:23:07,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:23:07,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:07,028 INFO L225 Difference]: With dead ends: 692 [2019-08-04 21:23:07,028 INFO L226 Difference]: Without dead ends: 692 [2019-08-04 21:23:07,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=492, Invalid=1400, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:23:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-08-04 21:23:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 233. [2019-08-04 21:23:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-04 21:23:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 533 transitions. [2019-08-04 21:23:07,034 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 533 transitions. Word has length 16 [2019-08-04 21:23:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:07,034 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 533 transitions. [2019-08-04 21:23:07,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 533 transitions. [2019-08-04 21:23:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:07,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:07,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:23:07,035 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash -260138745, now seen corresponding path program 1 times [2019-08-04 21:23:07,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:07,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:07,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:07,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:07,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:07,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:07,092 INFO L87 Difference]: Start difference. First operand 233 states and 533 transitions. Second operand 10 states. [2019-08-04 21:23:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:08,818 INFO L93 Difference]: Finished difference Result 528 states and 1232 transitions. [2019-08-04 21:23:08,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:23:08,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-04 21:23:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:08,819 INFO L225 Difference]: With dead ends: 528 [2019-08-04 21:23:08,820 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:23:08,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:23:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:23:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:23:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:23:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:23:08,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-08-04 21:23:08,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:08,822 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:23:08,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:23:08,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:23:08,827 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:23:08 BoogieIcfgContainer [2019-08-04 21:23:08,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:23:08,829 INFO L168 Benchmark]: Toolchain (without parser) took 95382.04 ms. Allocated memory was 140.0 MB in the beginning and 362.3 MB in the end (delta: 222.3 MB). Free memory was 107.4 MB in the beginning and 301.3 MB in the end (delta: -193.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:08,830 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:23:08,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.26 ms. Allocated memory is still 140.0 MB. Free memory was 107.4 MB in the beginning and 105.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:08,831 INFO L168 Benchmark]: Boogie Preprocessor took 52.69 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:08,832 INFO L168 Benchmark]: RCFGBuilder took 790.13 ms. Allocated memory is still 140.0 MB. Free memory was 104.0 MB in the beginning and 79.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:23:08,832 INFO L168 Benchmark]: TraceAbstraction took 94477.28 ms. Allocated memory was 140.0 MB in the beginning and 362.3 MB in the end (delta: 222.3 MB). Free memory was 78.9 MB in the beginning and 301.3 MB in the end (delta: -222.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:23:08,835 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.26 ms. Allocated memory is still 140.0 MB. Free memory was 107.4 MB in the beginning and 105.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.69 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 790.13 ms. Allocated memory is still 140.0 MB. Free memory was 104.0 MB in the beginning and 79.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 94477.28 ms. Allocated memory was 140.0 MB in the beginning and 362.3 MB in the end (delta: 222.3 MB). Free memory was 78.9 MB in the beginning and 301.3 MB in the end (delta: -222.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 277]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 332]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 284]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 364]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 205]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 222]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 250]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 240]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 264]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 247]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 294]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 54]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 229]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 154]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 14 error locations. SAFE Result, 94.4s OverallTime, 44 OverallIterations, 2 TraceHistogramMax, 87.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12092 SDtfs, 30993 SDslu, 40849 SDs, 0 SdLazy, 74112 SolverSat, 6748 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1355 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 1007 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5273 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 20654 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 548 ConstructedInterpolants, 0 QuantifiedInterpolants, 24280 SizeOfPredicates, 190 NumberOfNonLiveVariables, 1662 ConjunctsInSsa, 348 ConjunctsInUnsatCore, 44 InterpolantComputations, 24 PerfectInterpolantSequences, 0/51 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...