java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:33:37,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:33:37,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:33:37,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:33:37,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:33:37,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:33:37,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:33:37,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:33:37,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:33:37,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:33:37,340 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:33:37,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:33:37,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:33:37,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:33:37,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:33:37,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:33:37,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:33:37,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:33:37,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:33:37,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:33:37,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:33:37,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:33:37,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:33:37,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:33:37,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:33:37,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:33:37,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:33:37,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:33:37,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:33:37,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:33:37,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:33:37,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:33:37,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:33:37,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:33:37,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:33:37,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:33:37,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:33:37,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:33:37,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:33:37,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:33:37,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:33:37,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:33:37,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:33:37,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:33:37,430 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:33:37,430 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:33:37,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl [2019-08-05 10:33:37,431 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl' [2019-08-05 10:33:37,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:33:37,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:33:37,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:33:37,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:33:37,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:33:37,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,493 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:33:37,494 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:33:37,494 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:33:37,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:33:37,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:33:37,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:33:37,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:33:37,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... [2019-08-05 10:33:37,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:33:37,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:33:37,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:33:37,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:33:37,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:33:37,574 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:33:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:33:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:33:37,791 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:33:37,791 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:33:37,792 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:33:37 BoogieIcfgContainer [2019-08-05 10:33:37,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:33:37,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:33:37,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:33:37,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:33:37,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:33:37" (1/2) ... [2019-08-05 10:33:37,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3d3fce and model type HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:33:37, skipping insertion in model container [2019-08-05 10:33:37,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:33:37" (2/2) ... [2019-08-05 10:33:37,801 INFO L109 eAbstractionObserver]: Analyzing ICFG HiddenEquality-Safe.bpl [2019-08-05 10:33:37,811 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:33:37,818 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:33:37,836 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:33:37,861 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:33:37,862 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:33:37,862 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:33:37,863 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:33:37,863 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:33:37,863 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:33:37,863 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:33:37,863 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:33:37,863 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:33:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-08-05 10:33:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:33:37,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:37,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:33:37,887 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 10:33:37,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:37,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:33:37,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:38,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:33:38,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:33:38,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:33:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:33:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:33:38,033 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-08-05 10:33:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:38,108 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:33:38,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:33:38,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:33:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:38,122 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:33:38,123 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 10:33:38,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:33:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 10:33:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 10:33:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 10:33:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 10:33:38,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-08-05 10:33:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:38,165 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 10:33:38,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:33:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 10:33:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:33:38,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:38,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:33:38,167 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 10:33:38,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:38,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:33:38,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:38,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:38,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:33:38,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:33:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:33:38,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:33:38,361 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-08-05 10:33:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:38,454 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:33:38,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:33:38,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:33:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:38,455 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:33:38,456 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:33:38,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:33:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:33:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:33:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:33:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:33:38,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:33:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:38,459 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:33:38,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:33:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:33:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:33:38,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:38,461 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 10:33:38,461 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:38,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-05 10:33:38,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:38,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:33:38,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:38,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:38,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:33:38,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:33:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:33:38,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:33:38,605 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:33:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:38,648 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:33:38,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:33:38,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:33:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:38,652 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:33:38,652 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:33:38,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:33:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:33:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:33:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:33:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:33:38,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:33:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:38,655 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:33:38,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:33:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:33:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:33:38,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:38,657 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 10:33:38,657 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:38,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:38,657 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-05 10:33:38,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:38,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:33:38,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:38,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:38,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:33:38,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:33:38,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:33:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:33:38,763 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:33:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:38,803 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:33:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:33:38,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:33:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:38,805 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:33:38,805 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:33:38,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:33:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:33:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:33:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:33:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:33:38,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:33:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:38,809 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:33:38,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:33:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:33:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:33:38,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:38,810 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 10:33:38,810 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:38,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2019-08-05 10:33:38,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:38,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:33:38,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:39,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:39,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:33:39,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:33:39,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:33:39,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:33:39,036 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:33:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:39,062 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:33:39,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:33:39,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:33:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:39,068 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:33:39,068 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:33:39,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:33:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:33:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:33:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:33:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:33:39,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:33:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:39,072 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:33:39,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:33:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:33:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:33:39,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:39,075 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 10:33:39,075 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2019-08-05 10:33:39,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:39,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:33:39,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:39,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:39,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:33:39,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:33:39,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:33:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:33:39,320 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:33:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:39,369 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:33:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:33:39,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:33:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:39,370 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:33:39,370 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:33:39,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:33:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:33:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:33:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:33:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:33:39,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:33:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:39,373 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:33:39,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:33:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:33:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:33:39,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:39,374 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 10:33:39,374 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2019-08-05 10:33:39,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:39,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:33:39,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:39,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:39,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:33:39,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:33:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:33:39,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:33:39,643 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:33:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:39,676 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:33:39,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:33:39,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:33:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:39,678 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:33:39,679 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:33:39,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:33:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:33:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:33:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:33:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:33:39,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:33:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:39,683 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:33:39,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:33:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:33:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:33:39,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:39,684 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 10:33:39,684 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2019-08-05 10:33:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:39,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:33:39,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:39,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:39,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:33:39,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:33:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:33:39,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:33:39,818 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:33:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:39,846 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:33:39,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:33:39,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:33:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:39,848 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:33:39,848 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:33:39,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:33:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:33:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:33:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:33:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:33:39,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:33:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:39,852 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:33:39,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:33:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:33:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:33:39,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:39,853 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 10:33:39,853 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:39,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2019-08-05 10:33:39,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:39,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:33:39,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:40,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:40,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:33:40,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:33:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:33:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:33:40,086 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:33:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:40,127 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:33:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:33:40,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:33:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:40,128 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:33:40,129 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:33:40,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:33:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:33:40,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:33:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:33:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:33:40,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:33:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:40,134 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:33:40,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:33:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:33:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:33:40,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:40,135 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 10:33:40,135 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:40,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2019-08-05 10:33:40,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:40,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:33:40,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:40,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:40,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:33:40,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:33:40,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:33:40,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:33:40,528 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:33:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:40,556 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:33:40,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:33:40,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:33:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:40,557 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:33:40,557 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:33:40,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:33:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:33:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:33:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:33:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:33:40,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:33:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:40,561 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:33:40,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:33:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:33:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:33:40,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:40,562 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 10:33:40,562 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:40,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:40,562 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2019-08-05 10:33:40,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:40,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:33:40,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:40,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:40,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:33:40,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:33:40,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:33:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:33:40,768 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:33:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:40,810 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:33:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:33:40,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:33:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:40,812 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:33:40,812 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:33:40,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:33:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:33:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:33:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:33:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:33:40,824 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:33:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:40,824 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:33:40,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:33:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:33:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:33:40,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:40,825 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 10:33:40,826 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:40,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:40,826 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2019-08-05 10:33:40,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:33:40,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:41,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:41,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:33:41,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:33:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:33:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:33:41,072 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:33:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:41,140 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:33:41,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:33:41,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:33:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:41,142 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:33:41,142 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:33:41,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:33:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:33:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:33:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:33:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:33:41,146 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:33:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:41,146 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:33:41,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:33:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:33:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:33:41,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:41,147 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 10:33:41,147 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:41,148 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2019-08-05 10:33:41,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:41,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:33:41,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:41,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:41,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:33:41,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:33:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:33:41,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:33:41,419 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:33:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:41,442 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:33:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:33:41,447 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:33:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:41,448 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:33:41,448 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:33:41,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:33:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:33:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:33:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:33:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:33:41,451 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:33:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:41,451 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:33:41,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:33:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:33:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:33:41,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:41,452 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 10:33:41,452 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2019-08-05 10:33:41,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:41,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:33:41,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:41,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:41,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:33:41,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:33:41,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:33:41,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:33:41,671 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:33:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:41,697 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:33:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:33:41,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:33:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:41,698 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:33:41,698 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:33:41,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:33:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:33:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:33:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:33:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:33:41,701 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:33:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:41,701 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:33:41,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:33:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:33:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:33:41,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:41,702 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-05 10:33:41,702 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:41,702 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2019-08-05 10:33:41,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:41,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:33:41,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:41,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:41,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:33:41,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:33:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:33:41,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:33:41,920 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:33:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:41,945 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:33:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:33:41,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:33:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:41,947 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:33:41,947 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:33:41,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:33:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:33:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:33:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:33:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:33:41,951 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:33:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:41,952 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:33:41,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:33:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:33:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:33:41,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:41,953 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-05 10:33:41,953 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:41,953 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2019-08-05 10:33:41,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:41,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:33:41,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:42,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:42,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:33:42,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:33:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:33:42,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:33:42,225 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:33:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:42,422 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:33:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:33:42,423 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:33:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:42,424 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:33:42,424 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:33:42,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:33:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:33:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:33:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:33:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:33:42,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:33:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:42,428 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:33:42,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:33:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:33:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:33:42,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:42,429 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-05 10:33:42,430 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2019-08-05 10:33:42,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:42,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:33:42,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:42,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:42,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:33:42,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:33:42,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:33:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:33:42,731 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:33:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:42,998 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:33:42,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:33:42,999 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:33:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:42,999 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:33:42,999 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:33:43,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:33:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:33:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:33:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:33:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:33:43,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:33:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:43,003 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:33:43,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:33:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:33:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:33:43,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:43,004 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-05 10:33:43,004 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2019-08-05 10:33:43,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:43,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:33:43,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:43,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:43,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:33:43,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:33:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:33:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:33:43,530 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:33:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:43,577 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:33:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:33:43,577 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:33:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:43,578 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:33:43,578 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:33:43,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:33:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:33:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:33:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:33:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:33:43,583 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:33:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:43,583 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:33:43,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:33:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:33:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:33:43,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:43,584 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-05 10:33:43,584 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:43,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:43,584 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2019-08-05 10:33:43,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:43,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:33:43,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:43,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:43,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:33:43,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:33:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:33:43,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:43,971 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:33:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:44,017 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:33:44,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:33:44,017 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:33:44,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:44,018 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:33:44,018 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:33:44,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:33:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:33:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:33:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:33:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:33:44,022 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:33:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:44,022 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:33:44,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:33:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:33:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:33:44,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:44,023 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-05 10:33:44,023 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2019-08-05 10:33:44,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:44,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:33:44,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:33:44,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:33:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:33:44,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:44,450 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:33:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:44,507 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:33:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:33:44,508 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:33:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:44,508 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:33:44,508 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:33:44,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:33:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:33:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:33:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:33:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:33:44,513 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:33:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:44,513 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:33:44,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:33:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:33:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:33:44,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:44,514 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-05 10:33:44,514 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2019-08-05 10:33:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:44,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:33:44,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:44,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:44,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:33:44,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:33:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:33:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:44,948 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:33:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:44,980 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:33:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:33:44,981 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:33:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:44,982 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:33:44,982 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:33:44,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:33:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:33:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:33:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:33:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:33:44,986 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:33:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:44,987 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:33:44,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:33:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:33:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:33:44,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:44,988 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-05 10:33:44,988 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:44,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:44,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2019-08-05 10:33:44,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:45,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:33:45,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:45,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:45,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:33:45,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:33:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:33:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:33:45,287 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:33:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:45,390 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:33:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:33:45,392 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:33:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:45,393 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:33:45,393 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:33:45,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:33:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:33:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:33:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:33:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:33:45,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:33:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:45,397 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:33:45,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:33:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:33:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:33:45,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:45,398 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-05 10:33:45,398 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2019-08-05 10:33:45,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:45,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:33:45,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:45,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:45,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:33:45,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:33:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:33:45,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:33:45,774 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:33:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:45,804 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:33:45,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:33:45,804 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:33:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:45,805 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:33:45,805 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:33:45,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:33:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:33:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:33:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:33:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:33:45,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:33:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:45,810 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:33:45,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:33:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:33:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:33:45,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:45,811 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-05 10:33:45,811 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:45,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2019-08-05 10:33:45,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:45,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:33:45,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:46,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:33:46,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:33:46,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:33:46,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:33:46,207 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:33:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:46,244 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:33:46,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:33:46,251 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:33:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:46,251 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:33:46,251 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:33:46,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:33:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:33:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:33:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:33:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:33:46,254 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:33:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:46,255 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:33:46,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:33:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:33:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:33:46,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:46,256 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-05 10:33:46,256 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:46,256 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2019-08-05 10:33:46,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:46,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:33:46,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:46,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:46,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:33:46,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:33:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:33:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:33:46,862 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:33:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:46,937 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:33:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:33:46,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:33:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:46,939 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:33:46,939 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:33:46,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:33:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:33:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:33:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:33:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:33:46,944 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:33:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:46,944 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:33:46,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:33:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:33:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:33:46,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:46,945 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-05 10:33:46,945 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2019-08-05 10:33:46,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:46,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:33:46,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:47,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:47,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:33:47,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:33:47,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:33:47,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:33:47,655 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:33:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:47,691 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:33:47,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:33:47,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:33:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:47,692 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:33:47,692 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:33:47,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:33:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:33:47,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:33:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:33:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:33:47,696 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:33:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:47,696 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:33:47,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:33:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:33:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:33:47,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:47,697 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-05 10:33:47,697 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:47,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2019-08-05 10:33:47,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:47,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:33:47,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:48,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:48,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:33:48,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:33:48,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:33:48,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:33:48,508 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:33:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:48,550 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:33:48,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:33:48,551 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:33:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:48,551 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:33:48,551 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:33:48,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:33:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:33:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:33:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:33:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:33:48,554 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:33:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:48,555 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:33:48,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:33:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:33:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:33:48,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:48,555 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-05 10:33:48,555 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2019-08-05 10:33:48,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:48,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:33:48,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:49,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:33:49,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:33:49,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:33:49,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:33:49,053 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:33:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:49,293 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:33:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:33:49,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:33:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:49,294 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:33:49,294 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:33:49,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:33:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:33:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:33:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:33:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:33:49,299 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:33:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:49,299 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:33:49,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:33:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:33:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:33:49,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:49,299 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-05 10:33:49,300 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2019-08-05 10:33:49,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:49,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:33:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:50,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:50,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:33:50,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:33:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:33:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:33:50,484 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:33:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:50,531 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:33:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:33:50,531 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:33:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:50,532 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:33:50,532 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:33:50,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:33:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:33:50,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:33:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:33:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:33:50,537 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:33:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:50,538 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:33:50,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:33:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:33:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:33:50,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:50,539 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-05 10:33:50,539 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:50,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2019-08-05 10:33:50,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:50,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:33:50,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:50,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:50,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:33:50,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:33:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:33:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:33:50,940 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:33:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:51,069 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:33:51,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:33:51,070 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:33:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:51,070 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:33:51,070 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:33:51,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:33:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:33:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:33:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:33:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:33:51,073 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:33:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:51,074 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:33:51,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:33:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:33:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:33:51,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:51,074 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-05 10:33:51,075 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2019-08-05 10:33:51,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:51,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:33:51,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:51,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:51,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:33:51,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:33:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:33:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:33:51,544 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:33:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:51,625 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:33:51,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:33:51,625 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:33:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:51,626 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:33:51,626 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:33:51,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:33:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:33:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:33:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:33:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:33:51,630 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:33:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:51,630 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:33:51,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:33:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:33:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:33:51,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:51,631 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-05 10:33:51,631 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2019-08-05 10:33:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:51,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:33:51,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:52,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:52,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:33:52,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:33:52,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:33:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:33:52,159 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:33:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:52,207 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:33:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:33:52,207 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:33:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:52,208 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:33:52,208 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:33:52,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:33:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:33:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:33:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:33:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:33:52,212 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:33:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:52,213 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:33:52,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:33:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:33:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:33:52,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:52,213 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-05 10:33:52,213 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2019-08-05 10:33:52,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:52,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:33:52,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:52,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:52,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:33:52,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:33:52,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:33:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:33:52,797 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:33:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:52,867 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:33:52,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:33:52,867 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:33:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:52,868 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:33:52,868 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:33:52,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:33:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:33:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:33:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:33:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:33:52,872 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:33:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:52,872 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:33:52,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:33:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:33:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:33:52,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:52,873 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-05 10:33:52,874 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2019-08-05 10:33:52,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:52,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:33:52,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:53,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:53,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:33:53,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:33:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:33:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:33:53,494 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:33:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:53,532 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:33:53,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:33:53,533 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:33:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:53,533 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:33:53,533 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:33:53,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:33:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:33:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:33:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:33:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:33:53,537 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:33:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:53,537 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:33:53,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:33:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:33:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:33:53,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:53,538 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-05 10:33:53,538 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:53,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2019-08-05 10:33:53,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:53,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:33:53,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:54,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:54,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:33:54,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:33:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:33:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:33:54,144 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:33:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:54,192 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:33:54,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:33:54,193 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:33:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:54,193 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:33:54,193 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:33:54,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:33:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:33:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:33:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:33:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:33:54,197 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:33:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:54,197 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:33:54,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:33:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:33:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:33:54,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:54,198 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-05 10:33:54,198 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:54,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2019-08-05 10:33:54,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:54,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:33:54,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:55,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:55,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:33:55,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:33:55,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:33:55,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:33:55,115 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:33:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:55,189 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:33:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:33:55,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:33:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:55,190 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:33:55,190 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:33:55,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:33:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:33:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:33:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:33:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:33:55,194 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:33:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:55,194 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:33:55,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:33:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:33:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:33:55,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:55,195 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-05 10:33:55,196 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2019-08-05 10:33:55,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:55,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:33:55,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:57,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:57,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:33:57,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:33:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:33:57,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:33:57,171 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:33:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:57,215 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:33:57,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:33:57,215 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:33:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:57,216 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:33:57,216 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:33:57,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:33:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:33:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:33:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:33:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:33:57,220 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:33:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:57,220 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:33:57,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:33:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:33:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:33:57,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:57,221 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-05 10:33:57,221 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:57,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2019-08-05 10:33:57,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:57,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:33:57,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:57,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:57,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:33:57,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:33:57,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:33:57,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:33:57,833 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:33:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:57,891 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:33:57,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:33:57,892 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:33:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:57,892 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:33:57,892 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:33:57,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:33:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:33:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:33:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:33:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:33:57,895 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:33:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:57,895 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:33:57,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:33:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:33:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:33:57,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:57,896 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-05 10:33:57,896 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:57,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2019-08-05 10:33:57,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:57,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:33:57,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:58,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:58,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:33:58,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:33:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:33:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:33:58,497 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:33:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:58,586 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:33:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:33:58,587 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:33:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:58,587 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:33:58,588 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:33:58,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:33:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:33:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:33:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:33:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:33:58,591 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:33:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:58,591 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:33:58,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:33:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:33:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:33:58,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:58,593 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-05 10:33:58,593 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2019-08-05 10:33:58,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:58,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:33:58,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:33:59,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:59,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:33:59,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:33:59,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:33:59,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:33:59,308 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:33:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:59,358 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:33:59,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:33:59,359 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:33:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:59,360 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:33:59,360 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:33:59,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:33:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:33:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:33:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:33:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:33:59,362 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:33:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:59,363 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:33:59,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:33:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:33:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:33:59,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:59,363 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-05 10:33:59,363 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:33:59,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2019-08-05 10:33:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:59,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:33:59,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:00,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:00,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:34:00,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:34:00,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:34:00,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:34:00,410 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:34:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:00,477 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:34:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:34:00,477 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:34:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:00,478 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:34:00,478 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:34:00,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:34:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:34:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:34:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:34:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:34:00,481 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:34:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:00,481 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:34:00,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:34:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:34:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:34:00,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:00,482 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-05 10:34:00,482 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2019-08-05 10:34:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:00,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:34:00,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:01,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:01,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:34:01,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:34:01,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:34:01,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:34:01,159 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:34:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:01,222 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:34:01,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:34:01,223 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:34:01,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:01,224 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:34:01,224 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:34:01,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:34:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:34:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:34:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:34:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:34:01,226 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:34:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:01,227 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:34:01,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:34:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:34:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:34:01,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:01,228 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-05 10:34:01,228 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:01,228 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2019-08-05 10:34:01,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:01,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:34:01,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:01,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:01,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:34:01,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:34:01,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:34:01,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:34:01,954 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:34:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:02,010 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:34:02,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:34:02,010 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:34:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:02,011 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:34:02,011 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:34:02,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:34:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:34:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:34:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:34:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:34:02,014 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:34:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:02,015 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:34:02,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:34:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:34:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:34:02,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:02,015 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-05 10:34:02,016 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:02,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2019-08-05 10:34:02,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:02,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:34:02,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:02,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:02,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:34:02,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:34:02,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:34:02,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:34:02,807 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:34:02,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:02,864 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:34:02,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:34:02,864 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:34:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:02,865 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:34:02,865 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:34:02,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:34:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:34:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:34:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:34:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:34:02,868 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:34:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:02,868 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:34:02,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:34:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:34:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:34:02,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:02,869 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-05 10:34:02,869 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2019-08-05 10:34:02,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:02,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:34:02,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:03,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:03,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:34:03,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:34:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:34:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:34:03,870 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:34:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:03,957 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:34:03,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:34:03,957 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:34:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:03,958 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:34:03,958 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:34:03,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:34:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:34:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:34:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:34:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:34:03,960 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:34:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:03,961 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:34:03,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:34:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:34:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:34:03,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:03,962 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-05 10:34:03,962 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2019-08-05 10:34:03,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:03,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:34:03,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:05,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:05,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:34:05,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:34:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:34:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:34:05,194 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:34:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:05,640 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:34:05,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:34:05,640 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:34:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:05,641 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:34:05,641 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:34:05,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:34:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:34:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:34:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:34:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:34:05,644 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:34:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:05,645 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:34:05,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:34:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:34:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:34:05,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:05,646 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-05 10:34:05,646 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:05,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:05,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2019-08-05 10:34:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:05,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:34:05,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:06,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:06,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:34:06,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:34:06,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:34:06,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:34:06,833 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:34:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:06,892 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:34:06,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:34:06,893 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:34:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:06,893 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:34:06,894 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:34:06,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:34:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:34:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:34:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:34:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:34:06,896 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:34:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:06,897 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:34:06,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:34:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:34:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:34:06,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:06,898 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-05 10:34:06,898 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:06,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2019-08-05 10:34:06,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:06,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:34:06,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:07,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:07,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:34:07,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:34:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:34:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:34:07,787 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:34:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:07,844 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:34:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:34:07,844 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:34:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:07,845 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:34:07,845 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:34:07,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:34:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:34:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:34:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:34:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:34:07,847 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:34:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:07,848 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:34:07,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:34:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:34:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:34:07,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:07,848 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-05 10:34:07,848 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2019-08-05 10:34:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:07,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:34:07,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:08,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:08,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:34:08,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:34:08,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:34:08,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:34:08,882 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:34:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:08,954 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:34:08,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:34:08,955 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:34:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:08,956 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:34:08,956 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:34:08,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:34:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:34:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:34:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:34:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:34:08,958 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:34:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:08,959 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:34:08,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:34:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:34:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:34:08,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:08,960 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-05 10:34:08,960 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2019-08-05 10:34:08,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:08,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:34:08,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:09,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:09,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:34:09,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:34:09,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:34:09,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:34:09,881 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:34:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:09,954 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:34:09,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:34:09,955 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:34:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:09,955 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:34:09,955 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:34:09,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:34:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:34:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:34:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:34:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:34:09,958 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:34:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:09,958 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:34:09,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:34:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:34:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:34:09,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:09,959 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-05 10:34:09,959 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:09,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2019-08-05 10:34:09,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:09,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:34:09,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:11,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:11,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:34:11,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:34:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:34:11,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:34:11,099 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:34:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:11,165 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:34:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:34:11,166 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:34:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:11,167 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:34:11,167 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:34:11,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:34:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:34:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:34:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:34:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:34:11,169 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:34:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:11,170 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:34:11,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:34:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:34:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:34:11,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:11,171 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-05 10:34:11,171 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:11,171 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2019-08-05 10:34:11,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:11,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:34:11,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:12,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:12,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:34:12,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:34:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:34:12,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:34:12,282 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:34:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:12,345 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:34:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:34:12,345 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:34:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:12,346 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:34:12,346 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:34:12,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:34:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:34:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:34:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:34:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:34:12,349 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:34:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:12,350 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:34:12,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:34:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:34:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:34:12,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:12,351 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-05 10:34:12,351 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2019-08-05 10:34:12,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:12,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:34:12,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:34:13,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:34:13,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:34:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:34:13,783 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:34:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:13,853 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:34:13,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:34:13,854 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:34:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:13,855 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:34:13,855 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:34:13,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:34:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:34:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:34:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:34:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:34:13,858 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:34:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:13,858 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:34:13,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:34:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:34:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:34:13,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:13,859 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-05 10:34:13,859 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:13,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2019-08-05 10:34:13,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:13,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:34:13,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:14,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:14,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:34:14,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:34:14,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:34:14,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:34:14,932 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:34:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:15,095 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:34:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:34:15,096 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:34:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:15,096 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:34:15,096 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:34:15,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:34:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:34:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:34:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:34:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:34:15,098 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:34:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:15,098 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:34:15,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:34:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:34:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:34:15,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:15,099 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-05 10:34:15,099 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2019-08-05 10:34:15,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:15,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:34:15,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:16,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:16,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:34:16,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:34:16,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:34:16,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:34:16,450 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:34:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:16,531 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:34:16,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:34:16,532 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:34:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:16,533 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:34:16,533 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:34:16,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:34:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:34:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:34:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:34:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:34:16,536 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:34:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:16,536 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:34:16,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:34:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:34:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:34:16,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:16,537 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-05 10:34:16,537 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2019-08-05 10:34:16,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:16,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:34:16,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:17,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:17,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:34:17,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:34:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:34:17,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:34:17,728 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:34:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:17,799 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:34:17,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:34:17,799 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:34:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:17,800 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:34:17,800 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:34:17,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:34:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:34:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:34:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:34:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:34:17,803 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:34:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:17,803 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:34:17,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:34:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:34:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:34:17,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:17,804 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-05 10:34:17,804 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2019-08-05 10:34:17,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:17,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:34:17,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:19,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:34:19,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:34:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:34:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:34:19,182 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 10:34:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:19,247 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:34:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:34:19,248 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:34:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:19,248 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:34:19,249 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:34:19,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:34:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:34:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:34:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:34:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:34:19,252 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:34:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:19,253 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:34:19,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:34:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:34:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:34:19,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:19,253 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1] [2019-08-05 10:34:19,254 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:19,254 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2019-08-05 10:34:19,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:19,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:34:19,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:20,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:20,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:34:20,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:34:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:34:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:34:20,787 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 10:34:20,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:20,867 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:34:20,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:34:20,867 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 10:34:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:20,868 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:34:20,868 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:34:20,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:34:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:34:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:34:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:34:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:34:20,872 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:34:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:20,872 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:34:20,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:34:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:34:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:34:20,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:20,873 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1] [2019-08-05 10:34:20,873 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:20,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:20,874 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2019-08-05 10:34:20,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:20,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:34:20,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:22,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:22,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:34:22,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:34:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:34:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:34:22,100 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 10:34:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:22,179 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:34:22,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:34:22,180 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 10:34:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:22,180 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:34:22,181 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:34:22,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:34:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:34:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:34:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:34:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:34:22,183 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:34:22,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:22,183 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:34:22,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:34:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:34:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:34:22,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:22,184 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1] [2019-08-05 10:34:22,184 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2019-08-05 10:34:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:22,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:34:22,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:23,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:23,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:34:23,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:34:23,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:34:23,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:34:23,732 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 10:34:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:23,836 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:34:23,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:34:23,837 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 10:34:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:23,838 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:34:23,838 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:34:23,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:34:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:34:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:34:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:34:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:34:23,847 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:34:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:23,847 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:34:23,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:34:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:34:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:34:23,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:23,847 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1] [2019-08-05 10:34:23,848 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:23,848 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2019-08-05 10:34:23,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:23,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:34:23,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:25,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:25,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:34:25,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:34:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:34:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:34:25,331 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 10:34:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:25,445 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:34:25,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:34:25,445 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 10:34:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:25,445 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:34:25,446 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:34:25,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:34:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:34:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:34:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:34:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:34:25,447 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:34:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:25,448 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:34:25,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:34:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:34:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:34:25,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:25,449 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1] [2019-08-05 10:34:25,449 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2019-08-05 10:34:25,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:25,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:34:25,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:34:26,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:34:26,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:34:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:34:26,966 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 10:34:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:27,055 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:34:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:34:27,056 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 10:34:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:27,056 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:34:27,056 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:34:27,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:34:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:34:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:34:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:34:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:34:27,059 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:34:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:27,059 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:34:27,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:34:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:34:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:34:27,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:27,060 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1] [2019-08-05 10:34:27,060 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2019-08-05 10:34:27,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:27,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:34:27,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:28,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:28,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:34:28,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:34:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:34:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:34:28,490 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 10:34:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:28,580 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:34:28,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:34:28,581 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 10:34:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:28,582 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:34:28,582 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:34:28,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:34:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:34:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:34:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:34:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:34:28,585 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:34:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:28,585 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:34:28,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:34:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:34:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:34:28,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:28,586 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1] [2019-08-05 10:34:28,586 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2019-08-05 10:34:28,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:28,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:34:28,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:30,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:30,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:34:30,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:34:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:34:30,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:34:30,163 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 10:34:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:30,245 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:34:30,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:34:30,246 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 10:34:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:30,247 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:34:30,247 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:34:30,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:34:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:34:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:34:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:34:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:34:30,250 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:34:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:30,251 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:34:30,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:34:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:34:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:34:30,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:30,252 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1] [2019-08-05 10:34:30,252 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2019-08-05 10:34:30,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:30,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:34:30,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:32,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:32,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:34:32,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:34:32,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:34:32,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:34:32,116 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 10:34:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:32,233 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:34:32,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:34:32,234 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 10:34:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:32,235 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:34:32,235 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:34:32,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:34:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:34:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:34:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:34:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:34:32,237 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:34:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:32,238 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:34:32,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:34:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:34:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:34:32,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:32,239 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1] [2019-08-05 10:34:32,239 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2019-08-05 10:34:32,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:32,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:34:32,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:33,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:33,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:34:33,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:34:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:34:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:34:33,766 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 10:34:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:33,853 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:34:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:34:33,853 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 10:34:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:33,854 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:34:33,854 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:34:33,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:34:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:34:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:34:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:34:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:34:33,857 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:34:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:33,857 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:34:33,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:34:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:34:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:34:33,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:33,858 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1] [2019-08-05 10:34:33,858 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2019-08-05 10:34:33,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:33,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:34:33,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:35,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:35,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:34:35,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:34:35,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:34:35,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:34:35,425 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 10:34:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:35,543 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:34:35,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:34:35,544 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 10:34:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:35,544 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:34:35,544 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:34:35,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:34:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:34:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:34:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:34:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:34:35,546 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:34:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:35,546 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:34:35,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:34:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:34:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:34:35,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:35,547 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1] [2019-08-05 10:34:35,547 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2019-08-05 10:34:35,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:35,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:34:35,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:37,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:37,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:34:37,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:34:37,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:34:37,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:34:37,382 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 10:34:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:37,465 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:34:37,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:34:37,465 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 10:34:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:37,466 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:34:37,466 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:34:37,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:34:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:34:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:34:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:34:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:34:37,469 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:34:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:37,469 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:34:37,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:34:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:34:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:34:37,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:37,475 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1] [2019-08-05 10:34:37,475 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2019-08-05 10:34:37,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:37,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:34:37,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:39,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:39,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:34:39,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:34:39,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:34:39,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:34:39,162 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 10:34:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:39,247 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:34:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:34:39,248 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 10:34:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:39,249 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:34:39,249 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:34:39,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:34:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:34:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:34:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:34:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:34:39,251 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:34:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:39,252 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:34:39,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:34:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:34:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:34:39,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:39,253 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1] [2019-08-05 10:34:39,253 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2019-08-05 10:34:39,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:39,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:34:39,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:41,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:41,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:34:41,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:34:41,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:34:41,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:34:41,284 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 10:34:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:41,377 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:34:41,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:34:41,378 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 10:34:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:41,379 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:34:41,379 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:34:41,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:34:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:34:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:34:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:34:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:34:41,383 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:34:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:41,383 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:34:41,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:34:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:34:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:34:41,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:41,384 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1] [2019-08-05 10:34:41,384 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2019-08-05 10:34:41,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:41,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:34:41,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:44,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:44,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:34:44,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:34:44,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:34:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:34:44,679 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 10:34:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:44,802 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:34:44,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:34:44,802 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 10:34:44,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:44,803 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:34:44,803 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:34:44,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:34:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:34:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:34:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:34:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:34:44,807 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:34:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:44,808 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:34:44,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:34:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:34:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:34:44,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:44,808 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1] [2019-08-05 10:34:44,809 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:44,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:44,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2019-08-05 10:34:44,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:44,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:34:44,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:46,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:46,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:34:46,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:34:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:34:46,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:46,880 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 10:34:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:46,972 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:34:46,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:34:46,973 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 10:34:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:46,974 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:34:46,974 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:34:46,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:34:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:34:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:34:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:34:46,977 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:34:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:46,978 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:34:46,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:34:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:34:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:34:46,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:46,978 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1] [2019-08-05 10:34:46,979 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2019-08-05 10:34:46,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:46,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:34:46,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:49,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:49,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:34:49,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:34:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:34:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:49,372 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 10:34:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:49,455 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:34:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:34:49,456 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 10:34:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:49,456 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:34:49,457 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:34:49,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:34:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:34:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:34:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:34:49,460 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:34:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:49,460 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:34:49,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:34:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:34:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:34:49,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:49,461 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1] [2019-08-05 10:34:49,461 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2019-08-05 10:34:49,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:49,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:34:49,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:51,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:51,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:34:51,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:34:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:34:51,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:51,582 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 10:34:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:51,677 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:34:51,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:34:51,677 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 10:34:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:51,678 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:34:51,678 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:34:51,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:34:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:34:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:34:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:34:51,681 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:34:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:51,681 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:34:51,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:34:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:34:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:34:51,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:51,682 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1] [2019-08-05 10:34:51,682 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2019-08-05 10:34:51,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:51,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:34:51,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:53,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:53,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:34:53,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:34:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:34:53,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:53,694 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 10:34:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:53,792 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:34:53,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:34:53,793 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 10:34:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:53,794 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:34:53,794 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:34:53,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:34:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:34:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:34:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:34:53,796 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:34:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:53,797 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:34:53,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:34:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:34:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:34:53,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:53,798 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1] [2019-08-05 10:34:53,798 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2019-08-05 10:34:53,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:53,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:34:53,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:55,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:55,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:34:55,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:34:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:34:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:55,823 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 10:34:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:55,924 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:34:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:34:55,924 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 10:34:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:55,925 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:34:55,925 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:34:55,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:34:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:34:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:34:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:34:55,928 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:34:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:55,928 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:34:55,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:34:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:34:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:34:55,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:55,929 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1] [2019-08-05 10:34:55,929 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2019-08-05 10:34:55,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:55,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:34:55,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:58,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:34:58,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:34:58,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:34:58,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:34:58,251 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 10:34:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:58,352 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:34:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:34:58,352 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 10:34:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:58,353 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:34:58,353 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:34:58,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:34:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:34:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:34:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:34:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:34:58,356 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:34:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:58,357 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:34:58,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:34:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:34:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:34:58,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:58,358 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1] [2019-08-05 10:34:58,358 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:34:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2019-08-05 10:34:58,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:58,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:34:58,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:00,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:00,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:35:00,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:35:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:35:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:35:00,486 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-08-05 10:35:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:00,600 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:35:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:35:00,601 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2019-08-05 10:35:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:00,601 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:35:00,602 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:35:00,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:35:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:35:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:35:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:35:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:35:00,604 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:35:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:00,605 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:35:00,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:35:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:35:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:35:00,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:00,606 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1] [2019-08-05 10:35:00,606 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2019-08-05 10:35:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:00,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:35:00,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:03,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:03,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:35:03,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:35:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:35:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:35:03,061 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2019-08-05 10:35:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:03,431 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:35:03,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:35:03,432 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2019-08-05 10:35:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:03,432 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:35:03,433 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:35:03,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:35:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:35:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:35:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:35:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:35:03,435 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:35:03,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:03,436 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:35:03,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:35:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:35:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:35:03,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:03,437 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1] [2019-08-05 10:35:03,437 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2019-08-05 10:35:03,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:03,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:35:03,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:05,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:05,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:35:05,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:35:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:35:05,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:35:05,705 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2019-08-05 10:35:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:05,806 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:35:05,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:35:05,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2019-08-05 10:35:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:05,808 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:35:05,808 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:35:05,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:35:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:35:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:35:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:35:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:35:05,810 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:35:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:05,811 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:35:05,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:35:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:35:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:35:05,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:05,812 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1] [2019-08-05 10:35:05,812 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2019-08-05 10:35:05,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:05,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:35:05,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:08,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:08,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:35:08,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:35:08,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:35:08,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:35:08,375 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2019-08-05 10:35:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:08,482 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:35:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:35:08,482 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2019-08-05 10:35:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:08,483 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:35:08,483 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:35:08,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:35:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:35:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:35:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:35:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:35:08,486 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:35:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:08,486 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:35:08,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:35:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:35:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:35:08,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:08,487 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1] [2019-08-05 10:35:08,487 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2019-08-05 10:35:08,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:08,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:35:08,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:13,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:13,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:35:13,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:35:13,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:35:13,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:35:13,068 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2019-08-05 10:35:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:13,174 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:35:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:35:13,175 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2019-08-05 10:35:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:13,175 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:35:13,176 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:35:13,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:35:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:35:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:35:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:35:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:35:13,178 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:35:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:13,179 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:35:13,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:35:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:35:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:35:13,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:13,180 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1] [2019-08-05 10:35:13,180 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2019-08-05 10:35:13,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:13,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:35:13,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:15,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:15,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:35:15,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:35:15,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:35:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:35:15,526 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2019-08-05 10:35:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:15,631 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:35:15,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:35:15,631 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2019-08-05 10:35:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:15,632 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:35:15,632 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:35:15,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:35:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:35:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:35:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:35:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:35:15,635 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:35:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:15,635 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:35:15,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:35:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:35:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:35:15,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:15,636 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1] [2019-08-05 10:35:15,636 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:15,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:15,637 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2019-08-05 10:35:15,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:15,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:35:15,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:18,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:18,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:35:18,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:35:18,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:35:18,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:35:18,522 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2019-08-05 10:35:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:18,724 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:35:18,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:35:18,725 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2019-08-05 10:35:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:18,725 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:35:18,725 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:35:18,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:35:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:35:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:35:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:35:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:35:18,728 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:35:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:18,729 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:35:18,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:35:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:35:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:35:18,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:18,730 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1] [2019-08-05 10:35:18,730 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2019-08-05 10:35:18,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:18,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:35:18,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:21,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:21,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:35:21,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:35:21,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:35:21,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:35:21,169 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2019-08-05 10:35:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:21,285 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:35:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:35:21,285 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2019-08-05 10:35:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:21,286 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:35:21,286 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:35:21,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:35:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:35:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:35:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:35:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:35:21,289 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:35:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:21,289 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:35:21,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:35:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:35:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:35:21,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:21,290 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1] [2019-08-05 10:35:21,290 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:21,291 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2019-08-05 10:35:21,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:21,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:35:21,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:24,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:24,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:35:24,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:35:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:35:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:35:24,136 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2019-08-05 10:35:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:24,322 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:35:24,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:35:24,323 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2019-08-05 10:35:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:24,324 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:35:24,324 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:35:24,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:35:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:35:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:35:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:35:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:35:24,326 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:35:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:24,326 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:35:24,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:35:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:35:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:35:24,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:24,327 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1] [2019-08-05 10:35:24,327 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2019-08-05 10:35:24,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:24,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:35:24,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:27,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:27,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:35:27,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:35:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:35:27,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:35:27,317 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2019-08-05 10:35:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:27,445 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:35:27,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:35:27,446 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2019-08-05 10:35:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:27,446 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:35:27,447 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:35:27,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:35:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:35:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:35:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:35:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:35:27,449 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:35:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:27,449 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:35:27,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:35:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:35:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:35:27,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:27,450 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1] [2019-08-05 10:35:27,450 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2019-08-05 10:35:27,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:27,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:35:27,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:30,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:30,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:35:30,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:35:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:35:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:35:30,117 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2019-08-05 10:35:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:30,318 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:35:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:35:30,318 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2019-08-05 10:35:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:30,319 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:35:30,319 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:35:30,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:35:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:35:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:35:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:35:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:35:30,322 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:35:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:30,322 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:35:30,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:35:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:35:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:35:30,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:30,324 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1] [2019-08-05 10:35:30,324 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2019-08-05 10:35:30,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:30,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:35:30,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:33,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:33,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:35:33,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:35:33,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:35:33,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:35:33,269 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2019-08-05 10:35:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:33,401 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:35:33,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:35:33,402 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2019-08-05 10:35:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:33,403 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:35:33,403 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:35:33,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:35:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:35:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:35:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:35:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:35:33,406 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:35:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:33,407 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:35:33,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:35:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:35:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:35:33,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:33,407 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1] [2019-08-05 10:35:33,408 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2019-08-05 10:35:33,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:33,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:35:33,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:36,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:36,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:35:36,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:35:36,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:35:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:35:36,199 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2019-08-05 10:35:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:37,110 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:35:37,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:35:37,111 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2019-08-05 10:35:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:37,112 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:35:37,112 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:35:37,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:35:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:35:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:35:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:35:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:35:37,116 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:35:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:37,116 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:35:37,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:35:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:35:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:35:37,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:37,118 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1] [2019-08-05 10:35:37,118 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2019-08-05 10:35:37,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:37,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:35:37,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:40,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:40,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:35:40,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:35:40,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:35:40,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:35:40,535 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2019-08-05 10:35:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:40,716 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:35:40,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:35:40,716 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2019-08-05 10:35:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:40,717 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:35:40,717 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:35:40,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:35:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:35:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:35:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:35:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:35:40,720 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:35:40,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:40,720 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:35:40,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:35:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:35:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:35:40,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:40,721 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1] [2019-08-05 10:35:40,721 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:40,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2019-08-05 10:35:40,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:40,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:35:40,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:43,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:43,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:35:43,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:35:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:35:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:35:43,929 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2019-08-05 10:35:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:44,054 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:35:44,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:35:44,055 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2019-08-05 10:35:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:44,056 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:35:44,056 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:35:44,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:35:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:35:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:35:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:35:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:35:44,059 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:35:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:44,059 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:35:44,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:35:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:35:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:35:44,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:44,060 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1] [2019-08-05 10:35:44,060 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:44,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2019-08-05 10:35:44,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:44,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:35:44,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:47,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:47,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:35:47,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:35:47,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:35:47,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:35:47,030 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2019-08-05 10:35:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:47,143 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:35:47,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:35:47,143 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2019-08-05 10:35:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:47,144 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:35:47,144 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:35:47,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:35:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:35:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:35:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:35:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:35:47,147 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:35:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:47,147 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:35:47,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:35:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:35:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:35:47,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:47,148 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1] [2019-08-05 10:35:47,148 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:47,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:47,148 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2019-08-05 10:35:47,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:47,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:35:47,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:50,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:35:50,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:35:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:35:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:35:50,301 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2019-08-05 10:35:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:50,438 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:35:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:35:50,438 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2019-08-05 10:35:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:50,439 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:35:50,439 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:35:50,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:35:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:35:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:35:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:35:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:35:50,442 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:35:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:50,442 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:35:50,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:35:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:35:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:35:50,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:50,443 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1] [2019-08-05 10:35:50,444 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2019-08-05 10:35:50,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:50,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:35:50,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:54,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:54,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:35:54,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:35:54,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:35:54,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:35:54,386 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2019-08-05 10:35:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:54,502 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:35:54,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:35:54,502 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2019-08-05 10:35:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:54,503 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:35:54,503 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:35:54,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:35:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:35:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:35:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:35:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:35:54,506 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:35:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:54,507 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:35:54,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:35:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:35:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:35:54,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:54,507 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1] [2019-08-05 10:35:54,507 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2019-08-05 10:35:54,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:54,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:35:54,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:35:57,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:57,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:35:57,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:35:57,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:35:57,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:35:57,983 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2019-08-05 10:35:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:58,108 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:35:58,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:35:58,109 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2019-08-05 10:35:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:58,110 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:35:58,110 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:35:58,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:35:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:35:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:35:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:35:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:35:58,113 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:35:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:58,113 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:35:58,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:35:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:35:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:35:58,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:58,113 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1] [2019-08-05 10:35:58,114 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:35:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2019-08-05 10:35:58,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:58,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:35:58,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:01,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:01,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:36:01,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:36:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:36:01,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:36:01,268 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2019-08-05 10:36:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:01,405 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:36:01,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:36:01,406 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2019-08-05 10:36:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:01,407 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:36:01,407 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:36:01,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:36:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:36:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:36:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:36:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:36:01,409 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:36:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:01,409 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:36:01,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:36:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:36:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:36:01,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:01,410 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1] [2019-08-05 10:36:01,410 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2019-08-05 10:36:01,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:01,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:36:01,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:04,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:04,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:36:04,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:36:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:36:04,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:36:04,877 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2019-08-05 10:36:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:05,009 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:36:05,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:36:05,009 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2019-08-05 10:36:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:05,010 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:36:05,010 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:36:05,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:36:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:36:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:36:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:36:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:36:05,012 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:36:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:05,012 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:36:05,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:36:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:36:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:36:05,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:05,013 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1] [2019-08-05 10:36:05,013 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:05,013 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2019-08-05 10:36:05,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:05,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:36:05,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:08,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:08,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:36:08,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:36:08,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:36:08,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:36:08,545 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2019-08-05 10:36:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:08,689 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:36:08,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:36:08,690 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2019-08-05 10:36:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:08,691 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:36:08,691 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:36:08,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:36:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:36:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:36:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:36:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:36:08,694 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:36:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:08,694 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:36:08,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:36:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:36:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:36:08,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:08,695 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1] [2019-08-05 10:36:08,695 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:08,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2019-08-05 10:36:08,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:08,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:36:08,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:12,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:12,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:36:12,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:36:12,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:36:12,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:36:12,070 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2019-08-05 10:36:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:12,221 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:36:12,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:36:12,221 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2019-08-05 10:36:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:12,222 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:36:12,222 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:36:12,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:36:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:36:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:36:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:36:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:36:12,225 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:36:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:12,225 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:36:12,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:36:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:36:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:36:12,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:12,227 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1] [2019-08-05 10:36:12,227 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:12,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2019-08-05 10:36:12,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:12,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-05 10:36:12,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:16,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:36:16,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:36:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:36:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:36:16,473 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2019-08-05 10:36:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:23,023 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:36:23,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:36:23,024 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2019-08-05 10:36:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:23,024 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:36:23,024 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:36:23,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:36:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:36:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:36:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:36:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:36:23,027 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:36:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:23,027 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:36:23,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:36:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:36:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:36:23,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:23,028 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1] [2019-08-05 10:36:23,028 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:36:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:23,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2019-08-05 10:36:23,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:23,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:36:23,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:27,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:36:27,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2019-08-05 10:36:27,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:36:27,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:36:27,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:36:27,449 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2019-08-05 10:36:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:27,691 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:36:27,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:36:27,692 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2019-08-05 10:36:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:27,692 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:36:27,692 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:36:27,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:36:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:36:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:36:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:36:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:36:27,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2019-08-05 10:36:27,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:27,694 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:36:27,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:36:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:36:27,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:36:27,700 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:36:27 BoogieIcfgContainer [2019-08-05 10:36:27,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:36:27,702 INFO L168 Benchmark]: Toolchain (without parser) took 170239.48 ms. Allocated memory was 142.1 MB in the beginning and 518.5 MB in the end (delta: 376.4 MB). Free memory was 111.9 MB in the beginning and 116.2 MB in the end (delta: -4.3 MB). Peak memory consumption was 372.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:27,703 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:36:27,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.21 ms. Allocated memory is still 142.1 MB. Free memory was 111.7 MB in the beginning and 109.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:27,704 INFO L168 Benchmark]: Boogie Preprocessor took 19.55 ms. Allocated memory is still 142.1 MB. Free memory was 109.7 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:27,705 INFO L168 Benchmark]: RCFGBuilder took 276.09 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 99.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:27,705 INFO L168 Benchmark]: TraceAbstraction took 169906.29 ms. Allocated memory was 142.1 MB in the beginning and 518.5 MB in the end (delta: 376.4 MB). Free memory was 99.5 MB in the beginning and 116.2 MB in the end (delta: -16.7 MB). Peak memory consumption was 359.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:36:27,708 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.20 ms. Allocated memory is still 142.1 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.21 ms. Allocated memory is still 142.1 MB. Free memory was 111.7 MB in the beginning and 109.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.55 ms. Allocated memory is still 142.1 MB. Free memory was 109.7 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 276.09 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 99.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 169906.29 ms. Allocated memory was 142.1 MB in the beginning and 518.5 MB in the end (delta: 376.4 MB). Free memory was 99.5 MB in the beginning and 116.2 MB in the end (delta: -16.7 MB). Peak memory consumption was 359.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. SAFE Result, 169.8s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 203 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 17146 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5253 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 148.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=101, 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.2s AutomataMinimizationTime, 102 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 150.2s InterpolantComputationTime, 5355 NumberOfCodeBlocks, 5355 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 5253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1076865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 21522 ConjunctsInSsa, 5456 ConjunctsInUnsatCore, 102 InterpolantComputations, 2 PerfectInterpolantSequences, 5151/176851 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...