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/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:44:55,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:44:55,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:44:55,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:44:55,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:44:55,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:44:55,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:44:55,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:44:55,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:44:55,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:44:55,450 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:44:55,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:44:55,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:44:55,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:44:55,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:44:55,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:44:55,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:44:55,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:44:55,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:44:55,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:44:55,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:44:55,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:44:55,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:44:55,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:44:55,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:44:55,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:44:55,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:44:55,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:44:55,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:44:55,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:44:55,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:44:55,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:44:55,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:44:55,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:44:55,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:44:55,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:44:55,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:44:55,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:44:55,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:44:55,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:44:55,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:44:55,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:44:55,528 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:44:55,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:44:55,532 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:44:55,533 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:44:55,534 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-08-04 21:44:55,534 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-08-04 21:44:55,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:44:55,573 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:44:55,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:44:55,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:44:55,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:44:55,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,609 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-04 21:44:55,609 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-04 21:44:55,609 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-04 21:44:55,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:44:55,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:44:55,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:44:55,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:44:55,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... [2019-08-04 21:44:55,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:44:55,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:44:55,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:44:55,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:44:55,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:44:55,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-04 21:44:55,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-04 21:44:55,706 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-08-04 21:44:56,002 INFO L275 CfgBuilder]: Using library mode [2019-08-04 21:44:56,003 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:44:56,004 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:44:56 BoogieIcfgContainer [2019-08-04 21:44:56,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:44:56,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:44:56,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:44:56,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:44:56,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:44:55" (1/2) ... [2019-08-04 21:44:56,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7664c109 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:44:56, skipping insertion in model container [2019-08-04 21:44:56,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:44:56" (2/2) ... [2019-08-04 21:44:56,014 INFO L109 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-08-04 21:44:56,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:44:56,035 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:44:56,053 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:44:56,088 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:44:56,088 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:44:56,089 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:44:56,089 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:44:56,089 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:44:56,089 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:44:56,089 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:44:56,089 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:44:56,090 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:44:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-04 21:44:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:44:56,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:56,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:44:56,122 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-08-04 21:44:56,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:56,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:44:56,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:56,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:56,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:56,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:56,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:56,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:56,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:44:56,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-04 21:44:56,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:44:56,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:44:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:44:56,446 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-04 21:44:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:56,508 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:44:56,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:44:56,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-04 21:44:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:56,521 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:44:56,522 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:44:56,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-04 21:44:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:44:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:44:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:44:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:44:56,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-04 21:44:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:56,553 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:44:56,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:44:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:44:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:44:56,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:56,555 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-04 21:44:56,555 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1864331893, now seen corresponding path program 1 times [2019-08-04 21:44:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:56,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:44:56,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:56,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:56,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:56,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:56,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:56,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:56,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:56,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-04 21:44:56,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:44:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:44:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:44:56,877 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-04 21:44:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:56,940 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:44:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:44:56,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-04 21:44:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:56,941 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:44:56,942 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:44:56,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-04 21:44:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:44:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:44:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:44:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:44:56,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-08-04 21:44:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:56,946 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:44:56,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:44:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:44:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:44:56,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:56,947 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1] [2019-08-04 21:44:56,948 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:56,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2089621766, now seen corresponding path program 2 times [2019-08-04 21:44:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:56,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:44:56,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:57,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:57,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:57,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:57,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:57,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:57,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:57,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:44:57,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:44:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:44:57,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:44:57,152 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2019-08-04 21:44:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:57,217 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:44:57,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:44:57,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-04 21:44:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:57,218 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:44:57,218 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:44:57,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:44:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:44:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:44:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:44:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:44:57,221 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2019-08-04 21:44:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:57,222 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:44:57,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:44:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:44:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:44:57,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:57,223 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1] [2019-08-04 21:44:57,223 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash 666344661, now seen corresponding path program 3 times [2019-08-04 21:44:57,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:57,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:44:57,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:57,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:57,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:57,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:57,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:57,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:57,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:57,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:44:57,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:44:57,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:44:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:44:57,591 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2019-08-04 21:44:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:57,643 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:44:57,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:44:57,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-04 21:44:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:57,644 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:44:57,644 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:44:57,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:44:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:44:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:44:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:44:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:44:57,649 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2019-08-04 21:44:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:57,649 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:44:57,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:44:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:44:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:44:57,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:57,651 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1] [2019-08-04 21:44:57,651 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash -264744282, now seen corresponding path program 4 times [2019-08-04 21:44:57,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:57,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:44:57,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:57,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:57,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:57,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:57,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:57,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:57,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:57,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:44:57,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:44:57,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:44:57,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:44:57,947 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2019-08-04 21:44:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:58,078 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:44:58,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:44:58,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-08-04 21:44:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:58,080 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:44:58,081 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:44:58,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-04 21:44:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:44:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:44:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:44:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:44:58,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2019-08-04 21:44:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:58,085 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:44:58,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:44:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:44:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:44:58,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:58,086 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1] [2019-08-04 21:44:58,086 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1436647627, now seen corresponding path program 5 times [2019-08-04 21:44:58,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:58,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:44:58,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:58,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:58,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:58,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:58,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:58,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:58,326 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-04 21:44:58,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:58,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:44:58,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:44:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:44:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:44:58,328 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2019-08-04 21:44:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:58,391 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:44:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:44:58,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-08-04 21:44:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:58,393 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:44:58,393 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:44:58,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:44:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:44:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:44:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:44:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:44:58,397 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2019-08-04 21:44:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:58,397 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:44:58,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:44:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:44:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:44:58,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:58,398 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1] [2019-08-04 21:44:58,399 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:58,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:58,399 INFO L82 PathProgramCache]: Analyzing trace with hash 179950662, now seen corresponding path program 6 times [2019-08-04 21:44:58,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:58,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:44:58,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:58,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:58,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:58,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:58,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:58,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:58,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:58,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:44:58,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:44:58,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:44:58,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:44:58,909 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-08-04 21:44:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:58,980 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:44:58,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:44:58,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-08-04 21:44:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:58,986 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:44:58,986 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:44:58,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:44:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:44:58,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:44:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:44:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:44:58,991 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2019-08-04 21:44:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:58,991 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:44:58,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:44:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:44:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:44:58,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:58,992 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1] [2019-08-04 21:44:58,993 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash 791288213, now seen corresponding path program 7 times [2019-08-04 21:44:58,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:59,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:44:59,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:59,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:59,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:59,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:59,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:59,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:59,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:59,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:44:59,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:44:59,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:44:59,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:44:59,234 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2019-08-04 21:44:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:59,307 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:44:59,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:44:59,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-08-04 21:44:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:59,309 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:44:59,309 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:44:59,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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-04 21:44:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:44:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:44:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:44:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:44:59,314 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2019-08-04 21:44:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:59,314 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:44:59,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:44:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:44:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:44:59,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:59,315 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1] [2019-08-04 21:44:59,316 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1808032282, now seen corresponding path program 8 times [2019-08-04 21:44:59,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:59,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:44:59,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:59,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:59,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:59,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:59,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:59,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:44:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:44:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:44:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:44:59,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:44:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:44:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:44:59,569 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2019-08-04 21:44:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:44:59,651 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:44:59,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:44:59,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-08-04 21:44:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:44:59,653 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:44:59,653 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:44:59,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:44:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:44:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:44:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:44:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:44:59,658 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2019-08-04 21:44:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:44:59,659 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:44:59,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:44:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:44:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:44:59,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:44:59,660 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1] [2019-08-04 21:44:59,660 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:44:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:44:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 95448053, now seen corresponding path program 9 times [2019-08-04 21:44:59,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:44:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:44:59,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:44:59,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:44:59,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:44:59,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:44:59,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:44:59,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:44:59,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:00,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:00,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:45:00,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:45:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:45:00,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:45:00,092 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 12 states. [2019-08-04 21:45:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:00,138 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:45:00,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:45:00,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-08-04 21:45:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:00,140 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:45:00,141 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:45:00,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:45:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:45:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:45:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:45:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:45:00,146 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2019-08-04 21:45:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:00,146 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:45:00,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:45:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:45:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:45:00,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:00,148 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1] [2019-08-04 21:45:00,148 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash 224898950, now seen corresponding path program 10 times [2019-08-04 21:45:00,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:00,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:45:00,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:00,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:00,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:00,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:00,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:00,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:00,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:00,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:45:00,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:45:00,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:45:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:45:00,578 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2019-08-04 21:45:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:00,698 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:45:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:45:00,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-08-04 21:45:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:00,700 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:45:00,700 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:45:00,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:45:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:45:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:45:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:45:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:45:00,706 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2019-08-04 21:45:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:00,706 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:45:00,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:45:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:45:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:45:00,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:00,710 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1] [2019-08-04 21:45:00,710 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash -184060331, now seen corresponding path program 11 times [2019-08-04 21:45:00,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:00,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:45:00,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:00,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:00,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:00,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:00,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:00,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:01,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:01,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:45:01,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:45:01,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:45:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:45:01,165 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2019-08-04 21:45:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:01,272 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:45:01,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:45:01,272 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-08-04 21:45:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:01,274 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:45:01,274 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:45:01,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 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-04 21:45:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:45:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:45:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:45:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:45:01,278 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2019-08-04 21:45:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:01,279 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:45:01,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:45:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:45:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:45:01,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:01,280 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1] [2019-08-04 21:45:01,280 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:01,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1332218150, now seen corresponding path program 12 times [2019-08-04 21:45:01,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:01,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:45:01,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:01,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:01,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:01,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:01,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:01,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:01,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:01,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:45:01,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:45:01,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:45:01,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:45:01,743 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2019-08-04 21:45:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:01,962 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:45:01,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:45:01,963 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-08-04 21:45:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:01,963 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:45:01,963 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:45:01,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 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-04 21:45:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:45:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:45:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:45:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:45:01,967 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2019-08-04 21:45:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:01,968 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:45:01,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:45:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:45:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:45:01,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:01,969 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1] [2019-08-04 21:45:01,969 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1681573707, now seen corresponding path program 13 times [2019-08-04 21:45:01,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:02,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:45:02,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:02,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:02,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:02,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:02,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:02,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:02,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:02,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:45:02,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:45:02,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:45:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:45:02,360 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2019-08-04 21:45:02,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:02,428 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:45:02,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:45:02,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-08-04 21:45:02,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:02,430 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:45:02,430 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:45:02,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:45:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:45:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:45:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:45:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:45:02,436 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2019-08-04 21:45:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:02,436 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:45:02,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:45:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:45:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:45:02,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:02,437 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1] [2019-08-04 21:45:02,438 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:02,438 INFO L82 PathProgramCache]: Analyzing trace with hash 736537286, now seen corresponding path program 14 times [2019-08-04 21:45:02,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:02,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:45:02,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:02,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:02,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:02,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:02,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:02,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:02,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:02,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:45:02,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:45:02,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:45:02,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:45:02,758 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2019-08-04 21:45:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:02,875 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:45:02,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:45:02,876 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-08-04 21:45:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:02,876 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:45:02,876 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:45:02,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:45:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:45:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:45:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:45:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:45:02,882 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2019-08-04 21:45:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:02,882 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:45:02,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:45:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:45:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:45:02,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:02,883 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1] [2019-08-04 21:45:02,884 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash -805326059, now seen corresponding path program 15 times [2019-08-04 21:45:02,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:02,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:45:02,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:02,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:02,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:02,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:02,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:02,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:03,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:03,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:45:03,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:45:03,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:45:03,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:45:03,441 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2019-08-04 21:45:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:03,517 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:45:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:45:03,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-08-04 21:45:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:03,517 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:45:03,518 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:45:03,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:45:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:45:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:45:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:45:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:45:03,523 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2019-08-04 21:45:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:03,523 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:45:03,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:45:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:45:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:45:03,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:03,525 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1] [2019-08-04 21:45:03,525 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:03,525 INFO L82 PathProgramCache]: Analyzing trace with hash 218993766, now seen corresponding path program 16 times [2019-08-04 21:45:03,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:03,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:45:03,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:03,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:03,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:03,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:03,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:03,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:04,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:45:04,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:45:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:45:04,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:45:04,018 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 19 states. [2019-08-04 21:45:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:04,128 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:45:04,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:45:04,128 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-08-04 21:45:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:04,129 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:45:04,129 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:45:04,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:45:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:45:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:45:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:45:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:45:04,134 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2019-08-04 21:45:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:04,134 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:45:04,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:45:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:45:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:45:04,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:04,135 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1] [2019-08-04 21:45:04,135 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:04,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash -11737739, now seen corresponding path program 17 times [2019-08-04 21:45:04,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:04,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:45:04,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:04,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:04,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:04,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:04,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:04,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:04,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:04,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:45:04,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:45:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:45:04,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:45:04,697 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 20 states. [2019-08-04 21:45:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:04,818 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:45:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:45:04,822 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-08-04 21:45:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:04,822 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:45:04,822 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:45:04,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 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-04 21:45:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:45:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:45:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:45:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:45:04,825 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2019-08-04 21:45:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:04,826 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:45:04,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:45:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:45:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:45:04,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:04,827 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1] [2019-08-04 21:45:04,827 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1786329594, now seen corresponding path program 18 times [2019-08-04 21:45:04,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:04,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:45:04,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:04,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:04,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:04,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:04,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:04,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:05,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:05,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:45:05,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:45:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:45:05,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:45:05,324 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 21 states. [2019-08-04 21:45:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:05,415 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:45:05,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:45:05,416 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2019-08-04 21:45:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:05,416 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:45:05,416 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:45:05,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 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-04 21:45:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:45:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:45:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:45:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:45:05,421 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2019-08-04 21:45:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:05,421 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:45:05,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:45:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:45:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:45:05,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:05,422 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1] [2019-08-04 21:45:05,422 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:05,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1899835435, now seen corresponding path program 19 times [2019-08-04 21:45:05,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:05,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:45:05,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:05,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:05,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:05,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:05,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:05,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:05,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:05,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:45:05,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:45:05,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:45:05,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:45:05,969 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 22 states. [2019-08-04 21:45:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:06,116 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:45:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:45:06,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2019-08-04 21:45:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:06,118 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:45:06,118 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:45:06,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 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-04 21:45:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:45:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:45:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:45:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:45:06,123 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2019-08-04 21:45:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:06,123 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:45:06,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:45:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:45:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:45:06,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:06,124 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1] [2019-08-04 21:45:06,124 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:06,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1081884582, now seen corresponding path program 20 times [2019-08-04 21:45:06,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:06,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:45:06,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:06,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:06,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:06,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:06,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:06,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:06,654 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-04 21:45:06,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:06,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:45:06,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:45:06,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:45:06,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:45:06,655 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 23 states. [2019-08-04 21:45:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:06,761 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:45:06,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:45:06,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2019-08-04 21:45:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:06,762 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:45:06,763 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:45:06,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:45:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:45:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:45:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:45:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:45:06,768 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2019-08-04 21:45:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:06,768 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:45:06,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:45:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:45:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:45:06,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:06,770 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1] [2019-08-04 21:45:06,770 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash 989295157, now seen corresponding path program 21 times [2019-08-04 21:45:06,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:06,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:45:06,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:06,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:06,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:06,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:06,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:06,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:07,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:45:07,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:45:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:45:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:45:07,329 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 24 states. [2019-08-04 21:45:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:07,429 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:45:07,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:45:07,432 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-08-04 21:45:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:07,442 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:45:07,442 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:45:07,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:45:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:45:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:45:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:45:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:45:07,446 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2019-08-04 21:45:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:07,446 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:45:07,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:45:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:45:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:45:07,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:07,447 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1] [2019-08-04 21:45:07,447 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash 26739014, now seen corresponding path program 22 times [2019-08-04 21:45:07,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:07,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:45:07,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:07,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:07,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:07,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:07,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:07,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:08,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:08,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:45:08,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:45:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:45:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:45:08,415 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 25 states. [2019-08-04 21:45:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:08,503 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:45:08,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:45:08,503 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2019-08-04 21:45:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:08,504 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:45:08,504 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:45:08,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:45:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:45:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:45:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:45:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:45:08,509 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2019-08-04 21:45:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:08,509 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:45:08,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:45:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:45:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:45:08,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:08,510 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1] [2019-08-04 21:45:08,510 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:08,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:08,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2013318293, now seen corresponding path program 23 times [2019-08-04 21:45:08,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:08,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:45:08,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:08,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:08,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:08,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:08,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:08,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:09,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:45:09,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:45:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:45:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:45:09,158 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 26 states. [2019-08-04 21:45:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:09,251 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:45:09,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:45:09,252 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2019-08-04 21:45:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:09,253 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:45:09,253 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:45:09,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:45:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:45:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:45:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:45:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:45:09,257 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2019-08-04 21:45:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:09,258 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:45:09,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:45:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:45:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:45:09,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:09,259 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1] [2019-08-04 21:45:09,259 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:09,260 INFO L82 PathProgramCache]: Analyzing trace with hash -452719898, now seen corresponding path program 24 times [2019-08-04 21:45:09,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:09,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:45:09,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:09,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:09,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:09,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:09,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:09,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:10,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:10,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:45:10,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:45:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:45:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:45:10,174 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 27 states. [2019-08-04 21:45:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:10,283 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:45:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:45:10,283 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2019-08-04 21:45:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:10,284 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:45:10,284 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:45:10,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:45:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:45:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:45:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:45:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:45:10,288 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2019-08-04 21:45:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:10,288 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:45:10,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:45:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:45:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:45:10,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:10,289 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1] [2019-08-04 21:45:10,289 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash -780869899, now seen corresponding path program 25 times [2019-08-04 21:45:10,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:10,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:45:10,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:10,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:10,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:10,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:10,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:10,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:11,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:11,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:45:11,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:45:11,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:45:11,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:45:11,883 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 28 states. [2019-08-04 21:45:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:11,976 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:45:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:45:11,977 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2019-08-04 21:45:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:11,978 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:45:11,978 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:45:11,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:45:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:45:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:45:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:45:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:45:11,982 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2019-08-04 21:45:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:11,983 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:45:11,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:45:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:45:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:45:11,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:11,983 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1] [2019-08-04 21:45:11,984 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:11,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1351983994, now seen corresponding path program 26 times [2019-08-04 21:45:11,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:12,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:45:12,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:12,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:12,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:12,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:12,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:12,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:13,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:13,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:45:13,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:45:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:45:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:45:13,444 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 29 states. [2019-08-04 21:45:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:13,544 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:45:13,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:45:13,544 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2019-08-04 21:45:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:13,545 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:45:13,545 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:45:13,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:45:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:45:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:45:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:45:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-04 21:45:13,548 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2019-08-04 21:45:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:13,549 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-04 21:45:13,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:45:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-04 21:45:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:45:13,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:13,550 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1] [2019-08-04 21:45:13,550 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1248438613, now seen corresponding path program 27 times [2019-08-04 21:45:13,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:13,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:45:13,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:13,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:13,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:13,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:13,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:13,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:14,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:14,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:45:14,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:45:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:45:14,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:45:14,167 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 30 states. [2019-08-04 21:45:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:14,266 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-04 21:45:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:45:14,267 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2019-08-04 21:45:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:14,268 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:45:14,268 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:45:14,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 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-04 21:45:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:45:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:45:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:45:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-04 21:45:14,272 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2019-08-04 21:45:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:14,273 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-04 21:45:14,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:45:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-04 21:45:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:45:14,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:14,274 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1] [2019-08-04 21:45:14,274 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:14,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2113205798, now seen corresponding path program 28 times [2019-08-04 21:45:14,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:14,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:45:14,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:14,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:14,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:14,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:14,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:14,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 0 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:15,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:15,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:45:15,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:45:15,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:45:15,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:45:15,063 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 31 states. [2019-08-04 21:45:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:15,233 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-04 21:45:15,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:45:15,233 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2019-08-04 21:45:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:15,234 INFO L225 Difference]: With dead ends: 92 [2019-08-04 21:45:15,235 INFO L226 Difference]: Without dead ends: 92 [2019-08-04 21:45:15,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:45:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-04 21:45:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-04 21:45:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-04 21:45:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-04 21:45:15,238 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2019-08-04 21:45:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:15,238 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-04 21:45:15,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:45:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-04 21:45:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-04 21:45:15,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:15,239 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1] [2019-08-04 21:45:15,240 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1116394571, now seen corresponding path program 29 times [2019-08-04 21:45:15,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:15,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:45:15,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:15,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:15,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:15,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:15,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:15,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 0 proven. 1305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:16,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:16,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:45:16,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:45:16,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:45:16,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:45:16,056 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2019-08-04 21:45:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:16,254 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-04 21:45:16,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:45:16,254 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2019-08-04 21:45:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:16,256 INFO L225 Difference]: With dead ends: 95 [2019-08-04 21:45:16,256 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:45:16,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:45:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:45:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-04 21:45:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-04 21:45:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-04 21:45:16,259 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2019-08-04 21:45:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:16,259 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-04 21:45:16,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:45:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-04 21:45:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:45:16,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:16,260 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1] [2019-08-04 21:45:16,260 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1716377542, now seen corresponding path program 30 times [2019-08-04 21:45:16,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:16,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:45:16,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:16,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:16,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:16,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:16,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:16,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:16,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:16,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:45:16,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:45:16,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:45:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:45:16,988 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 33 states. [2019-08-04 21:45:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:17,103 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-04 21:45:17,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:45:17,103 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-08-04 21:45:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:17,105 INFO L225 Difference]: With dead ends: 98 [2019-08-04 21:45:17,105 INFO L226 Difference]: Without dead ends: 98 [2019-08-04 21:45:17,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:45:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-04 21:45:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-04 21:45:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-04 21:45:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-04 21:45:17,110 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2019-08-04 21:45:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:17,110 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-04 21:45:17,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:45:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-04 21:45:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-04 21:45:17,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:17,111 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1] [2019-08-04 21:45:17,111 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1017996821, now seen corresponding path program 31 times [2019-08-04 21:45:17,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:17,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:45:17,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:17,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:17,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:17,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:17,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:17,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 0 proven. 1488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:17,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:17,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:45:17,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:45:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:45:17,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:45:17,859 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 34 states. [2019-08-04 21:45:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:17,982 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-04 21:45:17,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:45:17,982 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2019-08-04 21:45:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:17,983 INFO L225 Difference]: With dead ends: 101 [2019-08-04 21:45:17,983 INFO L226 Difference]: Without dead ends: 101 [2019-08-04 21:45:17,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 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-04 21:45:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-04 21:45:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-04 21:45:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-04 21:45:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-04 21:45:17,987 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2019-08-04 21:45:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:17,987 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-04 21:45:17,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:45:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-04 21:45:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:45:17,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:17,988 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1] [2019-08-04 21:45:17,988 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash 379519334, now seen corresponding path program 32 times [2019-08-04 21:45:17,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:18,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:45:18,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:18,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:18,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:18,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:18,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:18,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:18,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:18,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:45:18,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:45:18,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:45:18,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:45:18,689 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 35 states. [2019-08-04 21:45:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:18,802 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-04 21:45:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:45:18,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-08-04 21:45:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:18,803 INFO L225 Difference]: With dead ends: 104 [2019-08-04 21:45:18,803 INFO L226 Difference]: Without dead ends: 104 [2019-08-04 21:45:18,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 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-04 21:45:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-04 21:45:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-04 21:45:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-04 21:45:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-04 21:45:18,808 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2019-08-04 21:45:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:18,809 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-04 21:45:18,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:45:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-04 21:45:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-04 21:45:18,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:18,810 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1] [2019-08-04 21:45:18,810 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1906858101, now seen corresponding path program 33 times [2019-08-04 21:45:18,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:18,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:45:18,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:18,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:18,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:18,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:18,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:18,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 0 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:19,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:19,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:45:19,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:45:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:45:19,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:45:19,581 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 36 states. [2019-08-04 21:45:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:19,700 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-04 21:45:19,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:45:19,700 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2019-08-04 21:45:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:19,702 INFO L225 Difference]: With dead ends: 107 [2019-08-04 21:45:19,702 INFO L226 Difference]: Without dead ends: 107 [2019-08-04 21:45:19,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:45:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-04 21:45:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-04 21:45:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-04 21:45:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-04 21:45:19,706 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2019-08-04 21:45:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:19,706 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-04 21:45:19,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:45:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-04 21:45:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:45:19,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:19,707 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1] [2019-08-04 21:45:19,708 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1972531974, now seen corresponding path program 34 times [2019-08-04 21:45:19,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:19,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:45:19,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:19,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:19,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:19,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:19,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:19,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 0 proven. 1785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:20,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:20,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:45:20,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:45:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:45:20,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:45:20,578 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 37 states. [2019-08-04 21:45:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:20,721 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-04 21:45:20,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:45:20,722 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2019-08-04 21:45:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:20,723 INFO L225 Difference]: With dead ends: 110 [2019-08-04 21:45:20,723 INFO L226 Difference]: Without dead ends: 110 [2019-08-04 21:45:20,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:45:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-04 21:45:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-04 21:45:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-04 21:45:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-04 21:45:20,728 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2019-08-04 21:45:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:20,728 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-04 21:45:20,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:45:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-04 21:45:20,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-04 21:45:20,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:20,729 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1] [2019-08-04 21:45:20,730 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash -42204459, now seen corresponding path program 35 times [2019-08-04 21:45:20,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:20,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:45:20,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:20,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:20,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:20,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:20,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:20,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 1890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:22,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:22,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:45:22,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:45:22,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:45:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:45:22,400 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 38 states. [2019-08-04 21:45:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:22,518 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-04 21:45:22,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:45:22,519 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2019-08-04 21:45:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:22,520 INFO L225 Difference]: With dead ends: 113 [2019-08-04 21:45:22,520 INFO L226 Difference]: Without dead ends: 113 [2019-08-04 21:45:22,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:45:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-04 21:45:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-04 21:45:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-04 21:45:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-04 21:45:22,523 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2019-08-04 21:45:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:22,523 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-04 21:45:22,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:45:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-04 21:45:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:45:22,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:22,524 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1] [2019-08-04 21:45:22,524 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1112681638, now seen corresponding path program 36 times [2019-08-04 21:45:22,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:22,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-04 21:45:22,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:22,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:22,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:22,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:22,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:22,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 0 proven. 1998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:23,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:23,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:45:23,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:45:23,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:45:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:45:23,559 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 39 states. [2019-08-04 21:45:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:23,686 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-04 21:45:23,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:45:23,687 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 112 [2019-08-04 21:45:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:23,688 INFO L225 Difference]: With dead ends: 116 [2019-08-04 21:45:23,688 INFO L226 Difference]: Without dead ends: 116 [2019-08-04 21:45:23,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:45:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-04 21:45:23,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-04 21:45:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-04 21:45:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-04 21:45:23,692 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2019-08-04 21:45:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:23,693 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-04 21:45:23,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:45:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-04 21:45:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-04 21:45:23,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:23,694 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1] [2019-08-04 21:45:23,694 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:23,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:23,694 INFO L82 PathProgramCache]: Analyzing trace with hash -658610891, now seen corresponding path program 37 times [2019-08-04 21:45:23,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:23,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:45:23,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:23,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:23,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:23,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:23,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:23,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 0 proven. 2109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:25,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:25,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:45:25,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:45:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:45:25,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:45:25,067 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 40 states. [2019-08-04 21:45:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:25,202 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-04 21:45:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:45:25,202 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2019-08-04 21:45:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:25,203 INFO L225 Difference]: With dead ends: 119 [2019-08-04 21:45:25,203 INFO L226 Difference]: Without dead ends: 119 [2019-08-04 21:45:25,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:45:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-04 21:45:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-04 21:45:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-04 21:45:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-04 21:45:25,207 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2019-08-04 21:45:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:25,207 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-04 21:45:25,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:45:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-04 21:45:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-04 21:45:25,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:25,208 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1] [2019-08-04 21:45:25,209 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:25,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:25,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1266143674, now seen corresponding path program 38 times [2019-08-04 21:45:25,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:25,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-04 21:45:25,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:25,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:25,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:25,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:25,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:25,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:26,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:26,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:45:26,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:45:26,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:45:26,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:45:26,702 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 41 states. [2019-08-04 21:45:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:26,837 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-04 21:45:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:45:26,838 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2019-08-04 21:45:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:26,839 INFO L225 Difference]: With dead ends: 122 [2019-08-04 21:45:26,839 INFO L226 Difference]: Without dead ends: 122 [2019-08-04 21:45:26,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:45:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-04 21:45:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-04 21:45:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-04 21:45:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-04 21:45:26,842 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2019-08-04 21:45:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:26,843 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-04 21:45:26,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:45:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-04 21:45:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-04 21:45:26,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:26,843 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1] [2019-08-04 21:45:26,844 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1283096683, now seen corresponding path program 39 times [2019-08-04 21:45:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:26,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-04 21:45:26,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:26,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:26,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:26,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:26,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:26,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 2340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:28,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:28,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:45:28,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:45:28,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:45:28,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:45:28,211 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 42 states. [2019-08-04 21:45:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:28,389 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-04 21:45:28,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:45:28,390 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-08-04 21:45:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:28,391 INFO L225 Difference]: With dead ends: 125 [2019-08-04 21:45:28,391 INFO L226 Difference]: Without dead ends: 125 [2019-08-04 21:45:28,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:45:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-04 21:45:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-04 21:45:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-04 21:45:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-04 21:45:28,395 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2019-08-04 21:45:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:28,395 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-04 21:45:28,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:45:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-04 21:45:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-04 21:45:28,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:28,397 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1] [2019-08-04 21:45:28,397 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:28,397 INFO L82 PathProgramCache]: Analyzing trace with hash 475953126, now seen corresponding path program 40 times [2019-08-04 21:45:28,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:28,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-04 21:45:28,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:28,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:28,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:28,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:28,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:28,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 0 proven. 2460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:29,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:29,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:45:29,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:45:29,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:45:29,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:45:29,414 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 43 states. [2019-08-04 21:45:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:29,556 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-04 21:45:29,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:45:29,564 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2019-08-04 21:45:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:29,565 INFO L225 Difference]: With dead ends: 128 [2019-08-04 21:45:29,565 INFO L226 Difference]: Without dead ends: 128 [2019-08-04 21:45:29,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:45:29,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-04 21:45:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-08-04 21:45:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-04 21:45:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-04 21:45:29,568 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2019-08-04 21:45:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:29,568 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-04 21:45:29,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:45:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-04 21:45:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-04 21:45:29,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:29,569 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1] [2019-08-04 21:45:29,569 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1432834549, now seen corresponding path program 41 times [2019-08-04 21:45:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:29,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-04 21:45:29,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:29,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:29,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:29,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:29,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:29,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 0 proven. 2583 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:30,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:30,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:45:30,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:45:30,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:45:30,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:45:30,986 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 44 states. [2019-08-04 21:45:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:31,226 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-04 21:45:31,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:45:31,227 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2019-08-04 21:45:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:31,228 INFO L225 Difference]: With dead ends: 131 [2019-08-04 21:45:31,228 INFO L226 Difference]: Without dead ends: 131 [2019-08-04 21:45:31,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:45:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-04 21:45:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-04 21:45:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-04 21:45:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-08-04 21:45:31,232 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2019-08-04 21:45:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:31,232 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-08-04 21:45:31,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:45:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-08-04 21:45:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-04 21:45:31,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:31,233 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1] [2019-08-04 21:45:31,234 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2105603706, now seen corresponding path program 42 times [2019-08-04 21:45:31,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:31,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-04 21:45:31,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:31,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:31,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:31,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:31,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:31,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 0 proven. 2709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:32,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:45:32,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:45:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:45:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:45:32,417 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 45 states. [2019-08-04 21:45:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:32,570 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-04 21:45:32,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:45:32,571 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 130 [2019-08-04 21:45:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:32,572 INFO L225 Difference]: With dead ends: 134 [2019-08-04 21:45:32,572 INFO L226 Difference]: Without dead ends: 134 [2019-08-04 21:45:32,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:45:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-04 21:45:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-08-04 21:45:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-04 21:45:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-04 21:45:32,576 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2019-08-04 21:45:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:32,577 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-04 21:45:32,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:45:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-04 21:45:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-04 21:45:32,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:32,578 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1] [2019-08-04 21:45:32,578 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash -42345387, now seen corresponding path program 43 times [2019-08-04 21:45:32,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:32,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-04 21:45:32,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:32,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:32,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:32,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:32,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:32,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 0 proven. 2838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:34,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:34,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:45:34,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:45:34,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:45:34,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:45:34,060 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 46 states. [2019-08-04 21:45:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:34,238 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-04 21:45:34,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:45:34,239 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2019-08-04 21:45:34,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:34,240 INFO L225 Difference]: With dead ends: 137 [2019-08-04 21:45:34,240 INFO L226 Difference]: Without dead ends: 137 [2019-08-04 21:45:34,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:45:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-04 21:45:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-04 21:45:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-04 21:45:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-04 21:45:34,244 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2019-08-04 21:45:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:34,245 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-04 21:45:34,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:45:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-04 21:45:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-04 21:45:34,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:34,245 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1] [2019-08-04 21:45:34,246 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1209262886, now seen corresponding path program 44 times [2019-08-04 21:45:34,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:34,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-04 21:45:34,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:34,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:34,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:34,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:34,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:34,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:35,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:35,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:45:35,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:45:35,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:45:35,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:45:35,499 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 47 states. [2019-08-04 21:45:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:35,659 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-04 21:45:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:45:35,660 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2019-08-04 21:45:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:35,661 INFO L225 Difference]: With dead ends: 140 [2019-08-04 21:45:35,661 INFO L226 Difference]: Without dead ends: 140 [2019-08-04 21:45:35,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:45:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-04 21:45:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-04 21:45:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-04 21:45:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-04 21:45:35,666 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2019-08-04 21:45:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:35,667 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-04 21:45:35,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:45:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-04 21:45:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-04 21:45:35,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:35,668 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1] [2019-08-04 21:45:35,668 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1034740043, now seen corresponding path program 45 times [2019-08-04 21:45:35,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:35,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-04 21:45:35,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:35,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:35,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:35,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:35,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:35,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:37,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:37,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:45:37,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:45:37,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:45:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:45:37,558 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 48 states. [2019-08-04 21:45:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:37,717 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-04 21:45:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:45:37,717 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2019-08-04 21:45:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:37,719 INFO L225 Difference]: With dead ends: 143 [2019-08-04 21:45:37,719 INFO L226 Difference]: Without dead ends: 143 [2019-08-04 21:45:37,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:45:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-04 21:45:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-04 21:45:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-04 21:45:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-08-04 21:45:37,724 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2019-08-04 21:45:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:37,724 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-08-04 21:45:37,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:45:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-08-04 21:45:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-04 21:45:37,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:37,725 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1] [2019-08-04 21:45:37,725 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:37,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash -960035642, now seen corresponding path program 46 times [2019-08-04 21:45:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:37,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-04 21:45:37,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:37,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:37,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:37,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:37,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:37,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:38,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:38,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:45:38,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:45:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:45:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:45:38,994 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 49 states. [2019-08-04 21:45:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:39,162 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-04 21:45:39,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:45:39,162 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2019-08-04 21:45:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:39,163 INFO L225 Difference]: With dead ends: 146 [2019-08-04 21:45:39,164 INFO L226 Difference]: Without dead ends: 146 [2019-08-04 21:45:39,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 94 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-04 21:45:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-04 21:45:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-08-04 21:45:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-04 21:45:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-04 21:45:39,166 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2019-08-04 21:45:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:39,167 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-04 21:45:39,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:45:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-04 21:45:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-04 21:45:39,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:39,168 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1] [2019-08-04 21:45:39,168 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash -234284779, now seen corresponding path program 47 times [2019-08-04 21:45:39,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:39,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-04 21:45:39,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:39,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:39,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:39,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:39,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:39,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 0 proven. 3384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:41,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:41,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:45:41,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:45:41,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:45:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:45:41,074 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 50 states. [2019-08-04 21:45:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:41,270 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-04 21:45:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:45:41,270 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 145 [2019-08-04 21:45:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:41,271 INFO L225 Difference]: With dead ends: 149 [2019-08-04 21:45:41,271 INFO L226 Difference]: Without dead ends: 149 [2019-08-04 21:45:41,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:45:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-04 21:45:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-04 21:45:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-04 21:45:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-04 21:45:41,274 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2019-08-04 21:45:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:41,274 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-04 21:45:41,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:45:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-04 21:45:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-04 21:45:41,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:41,275 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1] [2019-08-04 21:45:41,275 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:41,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:41,276 INFO L82 PathProgramCache]: Analyzing trace with hash -255693210, now seen corresponding path program 48 times [2019-08-04 21:45:41,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:41,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-04 21:45:41,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:41,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:41,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:41,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:41,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:41,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:42,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:42,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:45:42,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:45:42,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:45:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:45:42,837 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 51 states. [2019-08-04 21:45:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:43,037 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-08-04 21:45:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:45:43,037 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 148 [2019-08-04 21:45:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:43,039 INFO L225 Difference]: With dead ends: 152 [2019-08-04 21:45:43,039 INFO L226 Difference]: Without dead ends: 152 [2019-08-04 21:45:43,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:45:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-04 21:45:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-08-04 21:45:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-04 21:45:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-04 21:45:43,043 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2019-08-04 21:45:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:43,043 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-04 21:45:43,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:45:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-04 21:45:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-04 21:45:43,044 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:43,045 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1] [2019-08-04 21:45:43,045 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:43,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1915865973, now seen corresponding path program 49 times [2019-08-04 21:45:43,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:43,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-04 21:45:43,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:43,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:43,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:43,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:43,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:43,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 3675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:44,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:44,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:45:44,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:45:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:45:44,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:45:44,497 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 52 states. [2019-08-04 21:45:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:44,685 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-04 21:45:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:45:44,685 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 151 [2019-08-04 21:45:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:44,686 INFO L225 Difference]: With dead ends: 155 [2019-08-04 21:45:44,687 INFO L226 Difference]: Without dead ends: 155 [2019-08-04 21:45:44,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:45:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-04 21:45:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-04 21:45:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-04 21:45:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-08-04 21:45:44,691 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2019-08-04 21:45:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:44,691 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-08-04 21:45:44,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:45:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-08-04 21:45:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-04 21:45:44,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:44,692 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1] [2019-08-04 21:45:44,693 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:44,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:44,693 INFO L82 PathProgramCache]: Analyzing trace with hash -256892922, now seen corresponding path program 50 times [2019-08-04 21:45:44,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:44,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-04 21:45:44,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:44,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:44,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:44,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:44,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:44,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 3825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:46,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:46,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:45:46,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:45:46,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:45:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:45:46,916 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 53 states. [2019-08-04 21:45:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:47,121 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-04 21:45:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:45:47,122 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 154 [2019-08-04 21:45:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:47,124 INFO L225 Difference]: With dead ends: 158 [2019-08-04 21:45:47,124 INFO L226 Difference]: Without dead ends: 158 [2019-08-04 21:45:47,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:45:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-04 21:45:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-08-04 21:45:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-04 21:45:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-04 21:45:47,126 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2019-08-04 21:45:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:47,127 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-04 21:45:47,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:45:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-04 21:45:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-04 21:45:47,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:47,214 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1] [2019-08-04 21:45:47,214 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:47,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash 534984149, now seen corresponding path program 51 times [2019-08-04 21:45:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:47,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-04 21:45:47,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:47,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:47,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:47,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:47,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:47,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 0 proven. 3978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:48,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:48,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:45:48,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:45:48,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:45:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:45:48,677 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 54 states. [2019-08-04 21:45:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:49,036 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-04 21:45:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:45:49,036 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 157 [2019-08-04 21:45:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:49,038 INFO L225 Difference]: With dead ends: 161 [2019-08-04 21:45:49,038 INFO L226 Difference]: Without dead ends: 161 [2019-08-04 21:45:49,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:45:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-04 21:45:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-08-04 21:45:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-04 21:45:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-08-04 21:45:49,041 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2019-08-04 21:45:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:49,041 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-08-04 21:45:49,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:45:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-08-04 21:45:49,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-04 21:45:49,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:49,042 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1] [2019-08-04 21:45:49,042 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:49,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash -910550618, now seen corresponding path program 52 times [2019-08-04 21:45:49,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:49,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-04 21:45:49,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:49,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:49,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:49,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:49,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:49,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 0 proven. 4134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:50,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:50,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:45:50,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:45:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:45:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:45:50,559 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 55 states. [2019-08-04 21:45:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:50,740 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-04 21:45:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:45:50,741 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 160 [2019-08-04 21:45:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:50,742 INFO L225 Difference]: With dead ends: 164 [2019-08-04 21:45:50,742 INFO L226 Difference]: Without dead ends: 164 [2019-08-04 21:45:50,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:45:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-04 21:45:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-04 21:45:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-04 21:45:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-04 21:45:50,748 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2019-08-04 21:45:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:50,749 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-04 21:45:50,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:45:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-04 21:45:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-04 21:45:50,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:50,750 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1] [2019-08-04 21:45:50,750 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash 800282677, now seen corresponding path program 53 times [2019-08-04 21:45:50,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:50,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-04 21:45:50,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:50,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:50,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:50,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:50,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:50,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 0 proven. 4293 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:53,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:53,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:45:53,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:45:53,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:45:53,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:45:53,070 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 56 states. [2019-08-04 21:45:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:53,282 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-04 21:45:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:45:53,282 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 163 [2019-08-04 21:45:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:53,284 INFO L225 Difference]: With dead ends: 167 [2019-08-04 21:45:53,284 INFO L226 Difference]: Without dead ends: 167 [2019-08-04 21:45:53,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:45:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-04 21:45:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-04 21:45:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-04 21:45:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-08-04 21:45:53,287 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2019-08-04 21:45:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:53,288 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-08-04 21:45:53,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:45:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-08-04 21:45:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-04 21:45:53,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:53,289 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1] [2019-08-04 21:45:53,289 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:53,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash -141927610, now seen corresponding path program 54 times [2019-08-04 21:45:53,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:53,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-04 21:45:53,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:53,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:53,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:53,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:53,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:53,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:54,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:54,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:45:54,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:45:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:45:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:45:54,964 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 57 states. [2019-08-04 21:45:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:55,189 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-04 21:45:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:45:55,190 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 166 [2019-08-04 21:45:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:55,190 INFO L225 Difference]: With dead ends: 170 [2019-08-04 21:45:55,191 INFO L226 Difference]: Without dead ends: 170 [2019-08-04 21:45:55,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:45:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-04 21:45:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-08-04 21:45:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-08-04 21:45:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-08-04 21:45:55,193 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2019-08-04 21:45:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:55,193 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2019-08-04 21:45:55,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:45:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2019-08-04 21:45:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-04 21:45:55,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:55,194 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1] [2019-08-04 21:45:55,194 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1917308267, now seen corresponding path program 55 times [2019-08-04 21:45:55,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:55,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-04 21:45:55,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:55,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:55,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:55,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:55,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:55,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 0 proven. 4620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:57,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:57,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:45:57,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:45:57,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:45:57,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:45:57,014 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 58 states. [2019-08-04 21:45:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:57,265 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-04 21:45:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:45:57,265 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 169 [2019-08-04 21:45:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:57,266 INFO L225 Difference]: With dead ends: 173 [2019-08-04 21:45:57,266 INFO L226 Difference]: Without dead ends: 173 [2019-08-04 21:45:57,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:45:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-04 21:45:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-04 21:45:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-04 21:45:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-08-04 21:45:57,270 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2019-08-04 21:45:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:57,270 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-08-04 21:45:57,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:45:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-08-04 21:45:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-04 21:45:57,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:57,271 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1] [2019-08-04 21:45:57,271 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash 239789286, now seen corresponding path program 56 times [2019-08-04 21:45:57,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:57,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-04 21:45:57,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:57,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:57,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:57,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:57,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:57,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:45:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 0 proven. 4788 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:45:59,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:45:59,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:45:59,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:45:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:45:59,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:45:59,169 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 59 states. [2019-08-04 21:45:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:45:59,370 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-08-04 21:45:59,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:45:59,371 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 172 [2019-08-04 21:45:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:45:59,372 INFO L225 Difference]: With dead ends: 176 [2019-08-04 21:45:59,372 INFO L226 Difference]: Without dead ends: 176 [2019-08-04 21:45:59,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:45:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-04 21:45:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-08-04 21:45:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-04 21:45:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-08-04 21:45:59,376 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2019-08-04 21:45:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:45:59,377 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-08-04 21:45:59,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:45:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-08-04 21:45:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-04 21:45:59,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:45:59,378 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1] [2019-08-04 21:45:59,378 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:45:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:45:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1032307957, now seen corresponding path program 57 times [2019-08-04 21:45:59,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:45:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:45:59,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-04 21:45:59,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:45:59,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:45:59,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:45:59,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:45:59,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:45:59,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 0 proven. 4959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:01,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:01,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:46:01,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:46:01,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:46:01,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:46:01,560 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 60 states. [2019-08-04 21:46:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:01,888 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-04 21:46:01,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:46:01,889 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 175 [2019-08-04 21:46:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:01,889 INFO L225 Difference]: With dead ends: 179 [2019-08-04 21:46:01,890 INFO L226 Difference]: Without dead ends: 179 [2019-08-04 21:46:01,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:46:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-04 21:46:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-04 21:46:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-04 21:46:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-08-04 21:46:01,892 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2019-08-04 21:46:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:01,893 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-08-04 21:46:01,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:46:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-08-04 21:46:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-04 21:46:01,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:01,894 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1] [2019-08-04 21:46:01,894 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1520809606, now seen corresponding path program 58 times [2019-08-04 21:46:01,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:01,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-04 21:46:01,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:02,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:02,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:02,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:02,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:02,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 0 proven. 5133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:46:03,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:46:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:46:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:46:03,832 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 61 states. [2019-08-04 21:46:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:04,051 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-08-04 21:46:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:46:04,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 178 [2019-08-04 21:46:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:04,053 INFO L225 Difference]: With dead ends: 182 [2019-08-04 21:46:04,053 INFO L226 Difference]: Without dead ends: 182 [2019-08-04 21:46:04,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:46:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-04 21:46:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-08-04 21:46:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-04 21:46:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-08-04 21:46:04,057 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2019-08-04 21:46:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:04,057 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-08-04 21:46:04,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:46:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-08-04 21:46:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-08-04 21:46:04,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:04,058 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 1, 1] [2019-08-04 21:46:04,059 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1170731179, now seen corresponding path program 59 times [2019-08-04 21:46:04,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:04,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-04 21:46:04,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:04,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:04,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:04,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:04,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:04,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 0 proven. 5310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:05,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:05,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:46:05,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:46:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:46:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:46:05,986 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 62 states. [2019-08-04 21:46:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:06,284 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-08-04 21:46:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:46:06,285 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 181 [2019-08-04 21:46:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:06,286 INFO L225 Difference]: With dead ends: 185 [2019-08-04 21:46:06,287 INFO L226 Difference]: Without dead ends: 185 [2019-08-04 21:46:06,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:46:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-04 21:46:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-08-04 21:46:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-04 21:46:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-08-04 21:46:06,291 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2019-08-04 21:46:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:06,291 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-08-04 21:46:06,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:46:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-08-04 21:46:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-04 21:46:06,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:06,293 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 60, 1, 1] [2019-08-04 21:46:06,293 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:06,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2117808090, now seen corresponding path program 60 times [2019-08-04 21:46:06,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:06,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-04 21:46:06,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:06,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:06,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:06,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:06,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:06,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5490 backedges. 0 proven. 5490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:08,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:08,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:46:08,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:46:08,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:46:08,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:46:08,558 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 63 states. [2019-08-04 21:46:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:08,775 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2019-08-04 21:46:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:46:08,776 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 184 [2019-08-04 21:46:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:08,777 INFO L225 Difference]: With dead ends: 188 [2019-08-04 21:46:08,778 INFO L226 Difference]: Without dead ends: 188 [2019-08-04 21:46:08,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:46:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-04 21:46:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-04 21:46:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-04 21:46:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2019-08-04 21:46:08,781 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2019-08-04 21:46:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:08,782 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2019-08-04 21:46:08,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:46:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2019-08-04 21:46:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-08-04 21:46:08,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:08,783 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 61, 1, 1] [2019-08-04 21:46:08,783 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1449071029, now seen corresponding path program 61 times [2019-08-04 21:46:08,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:08,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-04 21:46:08,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:08,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:08,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:08,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:08,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:08,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 0 proven. 5673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:10,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:10,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:46:10,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:46:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:46:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:46:10,747 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 64 states. [2019-08-04 21:46:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:11,013 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-08-04 21:46:11,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:46:11,014 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 187 [2019-08-04 21:46:11,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:11,015 INFO L225 Difference]: With dead ends: 191 [2019-08-04 21:46:11,015 INFO L226 Difference]: Without dead ends: 191 [2019-08-04 21:46:11,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:46:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-04 21:46:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-08-04 21:46:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-08-04 21:46:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-08-04 21:46:11,019 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2019-08-04 21:46:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:11,019 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-08-04 21:46:11,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:46:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-08-04 21:46:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-04 21:46:11,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:11,020 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 62, 1, 1] [2019-08-04 21:46:11,020 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:11,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:11,020 INFO L82 PathProgramCache]: Analyzing trace with hash 559034822, now seen corresponding path program 62 times [2019-08-04 21:46:11,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:11,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-04 21:46:11,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:11,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:11,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:11,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:11,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:11,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 0 proven. 5859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:13,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:13,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:46:13,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:46:13,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:46:13,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:46:13,398 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 65 states. [2019-08-04 21:46:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:13,631 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-08-04 21:46:13,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:46:13,631 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 190 [2019-08-04 21:46:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:13,633 INFO L225 Difference]: With dead ends: 194 [2019-08-04 21:46:13,633 INFO L226 Difference]: Without dead ends: 194 [2019-08-04 21:46:13,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:46:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-04 21:46:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-08-04 21:46:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-04 21:46:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2019-08-04 21:46:13,637 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2019-08-04 21:46:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:13,637 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2019-08-04 21:46:13,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:46:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2019-08-04 21:46:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-04 21:46:13,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:13,638 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 63, 1, 1] [2019-08-04 21:46:13,638 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:13,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1676489707, now seen corresponding path program 63 times [2019-08-04 21:46:13,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:13,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-04 21:46:13,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:13,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:13,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:13,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:13,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:13,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 0 proven. 6048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:15,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:15,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:46:15,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:46:15,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:46:15,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:46:15,786 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 66 states. [2019-08-04 21:46:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:16,026 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-08-04 21:46:16,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:46:16,026 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 193 [2019-08-04 21:46:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:16,028 INFO L225 Difference]: With dead ends: 197 [2019-08-04 21:46:16,028 INFO L226 Difference]: Without dead ends: 197 [2019-08-04 21:46:16,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:46:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-04 21:46:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-08-04 21:46:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-04 21:46:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-08-04 21:46:16,031 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2019-08-04 21:46:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:16,031 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-08-04 21:46:16,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:46:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-08-04 21:46:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-04 21:46:16,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:16,033 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 1, 1] [2019-08-04 21:46:16,033 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:16,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1870125926, now seen corresponding path program 64 times [2019-08-04 21:46:16,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:16,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-04 21:46:16,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:16,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:16,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:16,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:16,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:16,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6240 backedges. 0 proven. 6240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:18,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:18,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:46:18,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:46:18,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:46:18,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:46:18,770 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 67 states. [2019-08-04 21:46:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:19,019 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-08-04 21:46:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:46:19,019 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 196 [2019-08-04 21:46:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:19,020 INFO L225 Difference]: With dead ends: 200 [2019-08-04 21:46:19,020 INFO L226 Difference]: Without dead ends: 200 [2019-08-04 21:46:19,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:46:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-04 21:46:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-04 21:46:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-04 21:46:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2019-08-04 21:46:19,025 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2019-08-04 21:46:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:19,025 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2019-08-04 21:46:19,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:46:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2019-08-04 21:46:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-04 21:46:19,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:19,027 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 65, 1, 1] [2019-08-04 21:46:19,027 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1394000267, now seen corresponding path program 65 times [2019-08-04 21:46:19,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:19,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-04 21:46:19,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:19,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:19,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:19,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:19,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:19,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 0 proven. 6435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:21,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:21,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:46:21,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:46:21,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:46:21,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:46:21,316 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 68 states. [2019-08-04 21:46:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:21,590 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-04 21:46:21,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:46:21,590 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 199 [2019-08-04 21:46:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:21,591 INFO L225 Difference]: With dead ends: 203 [2019-08-04 21:46:21,592 INFO L226 Difference]: Without dead ends: 203 [2019-08-04 21:46:21,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:46:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-04 21:46:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-04 21:46:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-04 21:46:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-08-04 21:46:21,595 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2019-08-04 21:46:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:21,596 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-08-04 21:46:21,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:46:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-08-04 21:46:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-04 21:46:21,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:21,597 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 66, 1, 1] [2019-08-04 21:46:21,597 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash -622867194, now seen corresponding path program 66 times [2019-08-04 21:46:21,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:21,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-04 21:46:21,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:21,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:21,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:21,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:21,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:21,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 0 proven. 6633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:24,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:24,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:46:24,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:46:24,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:46:24,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:46:24,693 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 69 states. [2019-08-04 21:46:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:24,941 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-08-04 21:46:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:46:24,942 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 202 [2019-08-04 21:46:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:24,943 INFO L225 Difference]: With dead ends: 206 [2019-08-04 21:46:24,943 INFO L226 Difference]: Without dead ends: 206 [2019-08-04 21:46:24,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:46:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-04 21:46:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-08-04 21:46:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-04 21:46:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-08-04 21:46:24,947 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2019-08-04 21:46:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:24,947 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-08-04 21:46:24,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:46:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-08-04 21:46:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-08-04 21:46:24,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:24,948 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 67, 1, 1] [2019-08-04 21:46:24,948 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1577555755, now seen corresponding path program 67 times [2019-08-04 21:46:24,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:25,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-04 21:46:25,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:25,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:25,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:25,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:25,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:25,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6834 backedges. 0 proven. 6834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:27,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:27,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:46:27,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:46:27,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:46:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:46:27,308 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 70 states. [2019-08-04 21:46:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:27,627 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-08-04 21:46:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:46:27,628 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 205 [2019-08-04 21:46:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:27,629 INFO L225 Difference]: With dead ends: 209 [2019-08-04 21:46:27,629 INFO L226 Difference]: Without dead ends: 209 [2019-08-04 21:46:27,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:46:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-04 21:46:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-08-04 21:46:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-04 21:46:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-08-04 21:46:27,631 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2019-08-04 21:46:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:27,631 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-08-04 21:46:27,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:46:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-08-04 21:46:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-04 21:46:27,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:27,632 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 68, 1, 1] [2019-08-04 21:46:27,632 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1431042394, now seen corresponding path program 68 times [2019-08-04 21:46:27,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:27,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-04 21:46:27,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:27,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:27,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:27,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:27,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:27,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7038 backedges. 0 proven. 7038 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:30,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:30,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:46:30,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:46:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:46:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:46:30,137 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 71 states. [2019-08-04 21:46:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:30,891 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2019-08-04 21:46:30,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:46:30,891 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 208 [2019-08-04 21:46:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:30,893 INFO L225 Difference]: With dead ends: 212 [2019-08-04 21:46:30,893 INFO L226 Difference]: Without dead ends: 212 [2019-08-04 21:46:30,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:46:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-04 21:46:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-08-04 21:46:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-04 21:46:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-08-04 21:46:30,896 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2019-08-04 21:46:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:30,897 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-08-04 21:46:30,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:46:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-08-04 21:46:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-08-04 21:46:30,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:30,898 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 69, 1, 1] [2019-08-04 21:46:30,898 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash -338277579, now seen corresponding path program 69 times [2019-08-04 21:46:30,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:30,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-04 21:46:30,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:31,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:31,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:31,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:31,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:31,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7245 backedges. 0 proven. 7245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:33,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:33,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:46:33,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:46:33,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:46:33,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:46:33,554 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 72 states. [2019-08-04 21:46:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:33,830 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-08-04 21:46:33,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:46:33,830 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 211 [2019-08-04 21:46:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:33,832 INFO L225 Difference]: With dead ends: 215 [2019-08-04 21:46:33,832 INFO L226 Difference]: Without dead ends: 215 [2019-08-04 21:46:33,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:46:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-04 21:46:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-08-04 21:46:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-08-04 21:46:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-08-04 21:46:33,836 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2019-08-04 21:46:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:33,836 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2019-08-04 21:46:33,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:46:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2019-08-04 21:46:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-08-04 21:46:33,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:33,838 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 70, 1, 1] [2019-08-04 21:46:33,838 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1633777594, now seen corresponding path program 70 times [2019-08-04 21:46:33,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:33,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-04 21:46:33,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:33,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:33,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:34,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:34,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:34,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7455 backedges. 0 proven. 7455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:36,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:36,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:46:36,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:46:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:46:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:46:36,385 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 73 states. [2019-08-04 21:46:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:36,646 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2019-08-04 21:46:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:46:36,646 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 214 [2019-08-04 21:46:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:36,648 INFO L225 Difference]: With dead ends: 218 [2019-08-04 21:46:36,648 INFO L226 Difference]: Without dead ends: 218 [2019-08-04 21:46:36,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:46:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-04 21:46:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-08-04 21:46:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-08-04 21:46:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2019-08-04 21:46:36,651 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2019-08-04 21:46:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:36,651 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2019-08-04 21:46:36,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:46:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2019-08-04 21:46:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-08-04 21:46:36,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:36,652 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 71, 1, 1] [2019-08-04 21:46:36,653 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:36,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1298602603, now seen corresponding path program 71 times [2019-08-04 21:46:36,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:36,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-04 21:46:36,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:36,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:36,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:36,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:36,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:36,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7668 backedges. 0 proven. 7668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:39,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:39,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:46:39,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:46:39,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:46:39,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:46:39,616 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 74 states. [2019-08-04 21:46:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:39,909 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-08-04 21:46:39,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:46:39,909 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 217 [2019-08-04 21:46:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:39,911 INFO L225 Difference]: With dead ends: 221 [2019-08-04 21:46:39,911 INFO L226 Difference]: Without dead ends: 221 [2019-08-04 21:46:39,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:46:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-04 21:46:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-08-04 21:46:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-04 21:46:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-08-04 21:46:39,915 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2019-08-04 21:46:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:39,915 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-08-04 21:46:39,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:46:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-08-04 21:46:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-08-04 21:46:39,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:39,916 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 72, 1, 1] [2019-08-04 21:46:39,916 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1899408922, now seen corresponding path program 72 times [2019-08-04 21:46:39,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:40,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-04 21:46:40,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:40,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:40,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:40,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:40,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:40,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 0 proven. 7884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:42,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:42,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:46:42,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:46:42,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:46:42,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:46:42,531 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 75 states. [2019-08-04 21:46:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:42,871 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2019-08-04 21:46:42,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:46:42,871 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 220 [2019-08-04 21:46:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:42,872 INFO L225 Difference]: With dead ends: 224 [2019-08-04 21:46:42,872 INFO L226 Difference]: Without dead ends: 224 [2019-08-04 21:46:42,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 146 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-04 21:46:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-04 21:46:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-08-04 21:46:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-04 21:46:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2019-08-04 21:46:42,875 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2019-08-04 21:46:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:42,875 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2019-08-04 21:46:42,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:46:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2019-08-04 21:46:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-04 21:46:42,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:42,876 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 73, 1, 1] [2019-08-04 21:46:42,877 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash 903231477, now seen corresponding path program 73 times [2019-08-04 21:46:42,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:42,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-04 21:46:42,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:43,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:43,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:43,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:43,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:43,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8103 backedges. 0 proven. 8103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:45,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:45,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:46:45,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:46:45,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:46:45,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:46:45,780 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 76 states. [2019-08-04 21:46:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:46,055 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-08-04 21:46:46,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:46:46,056 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 223 [2019-08-04 21:46:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:46,057 INFO L225 Difference]: With dead ends: 227 [2019-08-04 21:46:46,057 INFO L226 Difference]: Without dead ends: 227 [2019-08-04 21:46:46,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:46:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-04 21:46:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-08-04 21:46:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-04 21:46:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-08-04 21:46:46,061 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2019-08-04 21:46:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:46,062 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-08-04 21:46:46,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:46:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-08-04 21:46:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-08-04 21:46:46,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:46,063 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 74, 1, 1] [2019-08-04 21:46:46,063 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:46,064 INFO L82 PathProgramCache]: Analyzing trace with hash 199123846, now seen corresponding path program 74 times [2019-08-04 21:46:46,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:46,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 228 conjunts are in the unsatisfiable core [2019-08-04 21:46:46,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:46,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:46,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:46,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:46,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:46,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 0 proven. 8325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:49,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:49,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:46:49,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:46:49,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:46:49,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:46:49,047 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 77 states. [2019-08-04 21:46:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:49,330 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-08-04 21:46:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:46:49,330 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 226 [2019-08-04 21:46:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:49,332 INFO L225 Difference]: With dead ends: 230 [2019-08-04 21:46:49,332 INFO L226 Difference]: Without dead ends: 230 [2019-08-04 21:46:49,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:46:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-08-04 21:46:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-08-04 21:46:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-08-04 21:46:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2019-08-04 21:46:49,336 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2019-08-04 21:46:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:49,336 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2019-08-04 21:46:49,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:46:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2019-08-04 21:46:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-08-04 21:46:49,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:49,338 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 75, 1, 1] [2019-08-04 21:46:49,338 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 748962389, now seen corresponding path program 75 times [2019-08-04 21:46:49,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:49,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-04 21:46:49,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:49,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:49,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:49,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:49,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:49,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8550 backedges. 0 proven. 8550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:52,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:52,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:46:52,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:46:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:46:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:46:52,170 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 78 states. [2019-08-04 21:46:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:52,459 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-08-04 21:46:52,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:46:52,459 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 229 [2019-08-04 21:46:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:52,461 INFO L225 Difference]: With dead ends: 233 [2019-08-04 21:46:52,461 INFO L226 Difference]: Without dead ends: 233 [2019-08-04 21:46:52,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:46:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-04 21:46:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-08-04 21:46:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-04 21:46:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-08-04 21:46:52,465 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2019-08-04 21:46:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:52,465 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-08-04 21:46:52,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:46:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-08-04 21:46:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-04 21:46:52,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:52,467 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 76, 1, 1] [2019-08-04 21:46:52,467 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:52,467 INFO L82 PathProgramCache]: Analyzing trace with hash -16270042, now seen corresponding path program 76 times [2019-08-04 21:46:52,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:52,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-04 21:46:52,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:52,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:52,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:52,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:52,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:52,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:55,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:55,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:46:55,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:46:55,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:46:55,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:46:55,604 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 79 states. [2019-08-04 21:46:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:55,895 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-08-04 21:46:55,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:46:55,895 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 232 [2019-08-04 21:46:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:55,897 INFO L225 Difference]: With dead ends: 236 [2019-08-04 21:46:55,897 INFO L226 Difference]: Without dead ends: 236 [2019-08-04 21:46:55,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:46:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-08-04 21:46:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-08-04 21:46:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-08-04 21:46:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-08-04 21:46:55,901 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2019-08-04 21:46:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:55,901 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-08-04 21:46:55,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:46:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-08-04 21:46:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-08-04 21:46:55,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:55,902 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 77, 1, 1] [2019-08-04 21:46:55,902 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 630785205, now seen corresponding path program 77 times [2019-08-04 21:46:55,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:56,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-04 21:46:56,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:56,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:56,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:56,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:56,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:56,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:46:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9009 backedges. 0 proven. 9009 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:46:59,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:46:59,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:46:59,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:46:59,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:46:59,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:46:59,259 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 80 states. [2019-08-04 21:46:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:46:59,555 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-08-04 21:46:59,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:46:59,556 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 235 [2019-08-04 21:46:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:46:59,558 INFO L225 Difference]: With dead ends: 239 [2019-08-04 21:46:59,558 INFO L226 Difference]: Without dead ends: 239 [2019-08-04 21:46:59,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:46:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-04 21:46:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-08-04 21:46:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-08-04 21:46:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-08-04 21:46:59,561 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2019-08-04 21:46:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:46:59,562 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2019-08-04 21:46:59,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:46:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2019-08-04 21:46:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-08-04 21:46:59,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:46:59,563 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 78, 1, 1] [2019-08-04 21:46:59,563 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:46:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:46:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1240424134, now seen corresponding path program 78 times [2019-08-04 21:46:59,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:46:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:46:59,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-04 21:46:59,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:46:59,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:46:59,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:46:59,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:46:59,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:46:59,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9243 backedges. 0 proven. 9243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:02,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:02,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:47:02,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:47:02,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:47:02,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:47:02,603 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 81 states. [2019-08-04 21:47:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:02,914 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2019-08-04 21:47:02,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:47:02,914 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 238 [2019-08-04 21:47:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:02,916 INFO L225 Difference]: With dead ends: 242 [2019-08-04 21:47:02,916 INFO L226 Difference]: Without dead ends: 242 [2019-08-04 21:47:02,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:47:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-04 21:47:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-08-04 21:47:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-04 21:47:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-08-04 21:47:02,920 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2019-08-04 21:47:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:02,921 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2019-08-04 21:47:02,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:47:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2019-08-04 21:47:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-08-04 21:47:02,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:02,922 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 79, 1, 1] [2019-08-04 21:47:02,922 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash -422936811, now seen corresponding path program 79 times [2019-08-04 21:47:02,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:03,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-04 21:47:03,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:03,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:03,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:03,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:03,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:03,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9480 backedges. 0 proven. 9480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:06,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:06,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:47:06,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:47:06,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:47:06,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:47:06,439 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 82 states. [2019-08-04 21:47:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:06,749 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-08-04 21:47:06,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:47:06,750 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 241 [2019-08-04 21:47:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:06,751 INFO L225 Difference]: With dead ends: 245 [2019-08-04 21:47:06,751 INFO L226 Difference]: Without dead ends: 245 [2019-08-04 21:47:06,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:47:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-04 21:47:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-08-04 21:47:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-04 21:47:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-08-04 21:47:06,755 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2019-08-04 21:47:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:06,755 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-08-04 21:47:06,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:47:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-08-04 21:47:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-08-04 21:47:06,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:06,756 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 80, 1, 1] [2019-08-04 21:47:06,756 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1723811942, now seen corresponding path program 80 times [2019-08-04 21:47:06,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:06,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-04 21:47:06,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:06,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:06,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:06,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:06,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:06,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 0 proven. 9720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:10,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:10,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:47:10,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:47:10,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:47:10,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:47:10,625 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 83 states. [2019-08-04 21:47:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:10,931 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2019-08-04 21:47:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:47:10,932 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 244 [2019-08-04 21:47:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:10,934 INFO L225 Difference]: With dead ends: 248 [2019-08-04 21:47:10,934 INFO L226 Difference]: Without dead ends: 248 [2019-08-04 21:47:10,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:47:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-08-04 21:47:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-08-04 21:47:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-08-04 21:47:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2019-08-04 21:47:10,937 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2019-08-04 21:47:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:10,937 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2019-08-04 21:47:10,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:47:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2019-08-04 21:47:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-08-04 21:47:10,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:10,939 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 81, 1, 1] [2019-08-04 21:47:10,939 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash -842092171, now seen corresponding path program 81 times [2019-08-04 21:47:10,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:11,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-04 21:47:11,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:11,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:11,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:11,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:11,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:11,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9963 backedges. 0 proven. 9963 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:14,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:14,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:47:14,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:47:14,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:47:14,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:47:14,364 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 84 states. [2019-08-04 21:47:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:14,685 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-08-04 21:47:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:47:14,685 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 247 [2019-08-04 21:47:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:14,687 INFO L225 Difference]: With dead ends: 251 [2019-08-04 21:47:14,687 INFO L226 Difference]: Without dead ends: 251 [2019-08-04 21:47:14,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:47:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-08-04 21:47:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2019-08-04 21:47:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-08-04 21:47:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-08-04 21:47:14,690 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2019-08-04 21:47:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:14,690 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-08-04 21:47:14,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:47:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-08-04 21:47:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-08-04 21:47:14,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:14,691 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 82, 1, 1] [2019-08-04 21:47:14,691 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash 136411654, now seen corresponding path program 82 times [2019-08-04 21:47:14,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:14,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-04 21:47:14,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:14,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:14,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:14,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:14,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:14,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10209 backedges. 0 proven. 10209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:18,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:18,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:47:18,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:47:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:47:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:47:18,398 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 85 states. [2019-08-04 21:47:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:18,811 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-08-04 21:47:18,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:47:18,812 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 250 [2019-08-04 21:47:18,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:18,813 INFO L225 Difference]: With dead ends: 254 [2019-08-04 21:47:18,813 INFO L226 Difference]: Without dead ends: 254 [2019-08-04 21:47:18,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:47:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-04 21:47:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-08-04 21:47:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-08-04 21:47:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-08-04 21:47:18,816 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2019-08-04 21:47:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:18,816 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-08-04 21:47:18,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:47:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-08-04 21:47:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-08-04 21:47:18,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:18,818 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 83, 1, 1] [2019-08-04 21:47:18,818 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash 800824277, now seen corresponding path program 83 times [2019-08-04 21:47:18,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:18,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-04 21:47:18,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:18,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:18,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:19,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:19,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:19,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10458 backedges. 0 proven. 10458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:22,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:22,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:47:22,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:47:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:47:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:47:22,247 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 86 states. [2019-08-04 21:47:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:22,571 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2019-08-04 21:47:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:47:22,572 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 253 [2019-08-04 21:47:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:22,573 INFO L225 Difference]: With dead ends: 257 [2019-08-04 21:47:22,574 INFO L226 Difference]: Without dead ends: 257 [2019-08-04 21:47:22,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:47:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-04 21:47:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2019-08-04 21:47:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-04 21:47:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-08-04 21:47:22,577 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2019-08-04 21:47:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:22,577 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-08-04 21:47:22,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:47:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-08-04 21:47:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-08-04 21:47:22,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:22,578 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 84, 1, 1] [2019-08-04 21:47:22,579 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1186991194, now seen corresponding path program 84 times [2019-08-04 21:47:22,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:22,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-04 21:47:22,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:22,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:22,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:22,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:22,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:22,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10710 backedges. 0 proven. 10710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:26,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:26,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:47:26,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:47:26,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:47:26,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:47:26,364 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 87 states. [2019-08-04 21:47:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:26,696 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-08-04 21:47:26,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:47:26,697 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 256 [2019-08-04 21:47:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:26,698 INFO L225 Difference]: With dead ends: 260 [2019-08-04 21:47:26,699 INFO L226 Difference]: Without dead ends: 260 [2019-08-04 21:47:26,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:47:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-08-04 21:47:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-08-04 21:47:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-08-04 21:47:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2019-08-04 21:47:26,703 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2019-08-04 21:47:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:26,703 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2019-08-04 21:47:26,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:47:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2019-08-04 21:47:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-08-04 21:47:26,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:26,705 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 85, 1, 1] [2019-08-04 21:47:26,705 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1188610507, now seen corresponding path program 85 times [2019-08-04 21:47:26,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:26,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-04 21:47:26,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:26,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:26,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:26,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:26,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:26,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10965 backedges. 0 proven. 10965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:30,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:30,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:47:30,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:47:30,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:47:30,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:47:30,593 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 88 states. [2019-08-04 21:47:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:30,938 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-08-04 21:47:30,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:47:30,939 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 259 [2019-08-04 21:47:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:30,940 INFO L225 Difference]: With dead ends: 263 [2019-08-04 21:47:30,940 INFO L226 Difference]: Without dead ends: 263 [2019-08-04 21:47:30,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:47:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-08-04 21:47:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2019-08-04 21:47:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-08-04 21:47:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-08-04 21:47:30,945 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2019-08-04 21:47:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:30,945 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2019-08-04 21:47:30,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:47:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2019-08-04 21:47:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-08-04 21:47:30,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:30,946 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 86, 1, 1] [2019-08-04 21:47:30,946 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:30,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2110043462, now seen corresponding path program 86 times [2019-08-04 21:47:30,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:31,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-04 21:47:31,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:31,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:31,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:31,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:31,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:31,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11223 backedges. 0 proven. 11223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:34,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:34,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:47:34,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:47:34,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:47:34,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:47:34,879 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 89 states. [2019-08-04 21:47:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:35,227 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-08-04 21:47:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-04 21:47:35,228 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 262 [2019-08-04 21:47:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:35,230 INFO L225 Difference]: With dead ends: 266 [2019-08-04 21:47:35,230 INFO L226 Difference]: Without dead ends: 266 [2019-08-04 21:47:35,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:47:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-04 21:47:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-08-04 21:47:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-08-04 21:47:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-08-04 21:47:35,233 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2019-08-04 21:47:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:35,233 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-08-04 21:47:35,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-04 21:47:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-08-04 21:47:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-08-04 21:47:35,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:35,235 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 87, 1, 1] [2019-08-04 21:47:35,235 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:35,235 INFO L82 PathProgramCache]: Analyzing trace with hash -836265835, now seen corresponding path program 87 times [2019-08-04 21:47:35,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:35,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-04 21:47:35,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:35,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:35,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:35,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:35,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:35,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 0 proven. 11484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:38,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:38,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:47:38,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:47:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:47:38,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:47:38,952 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 90 states. [2019-08-04 21:47:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:39,406 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2019-08-04 21:47:39,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:47:39,407 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 265 [2019-08-04 21:47:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:39,408 INFO L225 Difference]: With dead ends: 269 [2019-08-04 21:47:39,409 INFO L226 Difference]: Without dead ends: 269 [2019-08-04 21:47:39,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:47:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-04 21:47:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-08-04 21:47:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-08-04 21:47:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-08-04 21:47:39,412 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2019-08-04 21:47:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:39,413 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-08-04 21:47:39,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:47:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-08-04 21:47:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-08-04 21:47:39,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:39,414 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 88, 1, 1] [2019-08-04 21:47:39,414 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:39,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:39,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1910095590, now seen corresponding path program 88 times [2019-08-04 21:47:39,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:39,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-04 21:47:39,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:39,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:39,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:39,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:39,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:39,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11748 backedges. 0 proven. 11748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:43,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:43,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:47:43,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-04 21:47:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-04 21:47:43,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:47:43,145 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 91 states. [2019-08-04 21:47:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:43,504 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2019-08-04 21:47:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:47:43,505 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 268 [2019-08-04 21:47:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:43,506 INFO L225 Difference]: With dead ends: 272 [2019-08-04 21:47:43,506 INFO L226 Difference]: Without dead ends: 272 [2019-08-04 21:47:43,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:47:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-08-04 21:47:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-08-04 21:47:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-08-04 21:47:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-08-04 21:47:43,509 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2019-08-04 21:47:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:43,510 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2019-08-04 21:47:43,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-04 21:47:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2019-08-04 21:47:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-08-04 21:47:43,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:43,511 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 89, 1, 1] [2019-08-04 21:47:43,511 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash -363681035, now seen corresponding path program 89 times [2019-08-04 21:47:43,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:43,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-04 21:47:43,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:43,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:43,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:43,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:43,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:43,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12015 backedges. 0 proven. 12015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:47,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:47,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-04 21:47:47,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:47:47,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:47:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:47:47,401 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 92 states. [2019-08-04 21:47:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:47,724 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-08-04 21:47:47,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:47:47,724 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 271 [2019-08-04 21:47:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:47,726 INFO L225 Difference]: With dead ends: 275 [2019-08-04 21:47:47,726 INFO L226 Difference]: Without dead ends: 275 [2019-08-04 21:47:47,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:47:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-08-04 21:47:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-08-04 21:47:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-08-04 21:47:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2019-08-04 21:47:47,730 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2019-08-04 21:47:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:47,730 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2019-08-04 21:47:47,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:47:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2019-08-04 21:47:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-08-04 21:47:47,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:47,731 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 90, 1, 1] [2019-08-04 21:47:47,731 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:47,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:47,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1781076102, now seen corresponding path program 90 times [2019-08-04 21:47:47,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:47,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 276 conjunts are in the unsatisfiable core [2019-08-04 21:47:47,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:47,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:47,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:47,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:47,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:47,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:51,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:51,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:47:51,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-04 21:47:51,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-04 21:47:51,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:47:51,867 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 93 states. [2019-08-04 21:47:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:52,211 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2019-08-04 21:47:52,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-04 21:47:52,212 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 274 [2019-08-04 21:47:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:52,213 INFO L225 Difference]: With dead ends: 278 [2019-08-04 21:47:52,214 INFO L226 Difference]: Without dead ends: 278 [2019-08-04 21:47:52,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:47:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-08-04 21:47:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-08-04 21:47:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-08-04 21:47:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2019-08-04 21:47:52,216 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2019-08-04 21:47:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:52,217 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2019-08-04 21:47:52,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-04 21:47:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2019-08-04 21:47:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-08-04 21:47:52,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:52,218 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 91, 1, 1] [2019-08-04 21:47:52,218 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash 12481877, now seen corresponding path program 91 times [2019-08-04 21:47:52,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:52,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-04 21:47:52,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:52,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:52,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:52,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:52,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:52,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:47:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12558 backedges. 0 proven. 12558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:47:56,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:47:56,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-04 21:47:56,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:47:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:47:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:47:56,328 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 94 states. [2019-08-04 21:47:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:47:56,666 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-08-04 21:47:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:47:56,666 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 277 [2019-08-04 21:47:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:47:56,668 INFO L225 Difference]: With dead ends: 281 [2019-08-04 21:47:56,668 INFO L226 Difference]: Without dead ends: 281 [2019-08-04 21:47:56,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:47:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-04 21:47:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-08-04 21:47:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-08-04 21:47:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-08-04 21:47:56,672 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2019-08-04 21:47:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:47:56,672 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-08-04 21:47:56,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:47:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-08-04 21:47:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-08-04 21:47:56,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:47:56,673 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 92, 1, 1] [2019-08-04 21:47:56,674 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:47:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:47:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1814255066, now seen corresponding path program 92 times [2019-08-04 21:47:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:47:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:47:56,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-04 21:47:56,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:47:56,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:47:56,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:47:56,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:47:56,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:47:56,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12834 backedges. 0 proven. 12834 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:00,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:00,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:48:00,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-04 21:48:00,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-04 21:48:00,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:48:00,982 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 95 states. [2019-08-04 21:48:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:01,354 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2019-08-04 21:48:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-04 21:48:01,354 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 280 [2019-08-04 21:48:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:01,356 INFO L225 Difference]: With dead ends: 284 [2019-08-04 21:48:01,356 INFO L226 Difference]: Without dead ends: 284 [2019-08-04 21:48:01,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:48:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-08-04 21:48:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2019-08-04 21:48:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-08-04 21:48:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2019-08-04 21:48:01,360 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2019-08-04 21:48:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:01,360 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2019-08-04 21:48:01,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-04 21:48:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2019-08-04 21:48:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-08-04 21:48:01,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:01,361 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 93, 1, 1] [2019-08-04 21:48:01,362 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash -603916363, now seen corresponding path program 93 times [2019-08-04 21:48:01,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:01,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-04 21:48:01,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:01,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:48:01,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:01,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:01,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:01,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:05,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:05,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-04 21:48:05,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-04 21:48:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-04 21:48:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:48:05,587 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 96 states. [2019-08-04 21:48:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:05,959 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-08-04 21:48:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:48:05,960 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 283 [2019-08-04 21:48:05,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:05,961 INFO L225 Difference]: With dead ends: 287 [2019-08-04 21:48:05,961 INFO L226 Difference]: Without dead ends: 287 [2019-08-04 21:48:05,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:48:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-08-04 21:48:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-08-04 21:48:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-08-04 21:48:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-08-04 21:48:05,965 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2019-08-04 21:48:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:05,965 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-08-04 21:48:05,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-04 21:48:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-08-04 21:48:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-08-04 21:48:05,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:05,966 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 94, 1, 1] [2019-08-04 21:48:05,967 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash 345934790, now seen corresponding path program 94 times [2019-08-04 21:48:05,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:06,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-04 21:48:06,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:06,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:48:06,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:06,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:06,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:06,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 13395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:10,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:10,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-04 21:48:10,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-04 21:48:10,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-04 21:48:10,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:48:10,262 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 97 states. [2019-08-04 21:48:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:10,615 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-08-04 21:48:10,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-04 21:48:10,615 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 286 [2019-08-04 21:48:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:10,617 INFO L225 Difference]: With dead ends: 290 [2019-08-04 21:48:10,617 INFO L226 Difference]: Without dead ends: 290 [2019-08-04 21:48:10,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:48:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-08-04 21:48:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2019-08-04 21:48:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-08-04 21:48:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2019-08-04 21:48:10,620 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2019-08-04 21:48:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:10,620 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2019-08-04 21:48:10,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-04 21:48:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2019-08-04 21:48:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-08-04 21:48:10,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:10,621 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 95, 1, 1] [2019-08-04 21:48:10,621 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2117087765, now seen corresponding path program 95 times [2019-08-04 21:48:10,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:10,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-04 21:48:10,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:10,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:48:10,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:10,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:10,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:10,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13680 backedges. 0 proven. 13680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:14,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:14,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-04 21:48:14,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-04 21:48:14,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-04 21:48:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:48:14,843 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 98 states. [2019-08-04 21:48:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:15,308 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2019-08-04 21:48:15,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:48:15,308 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 289 [2019-08-04 21:48:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:15,310 INFO L225 Difference]: With dead ends: 293 [2019-08-04 21:48:15,310 INFO L226 Difference]: Without dead ends: 293 [2019-08-04 21:48:15,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:48:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-04 21:48:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-08-04 21:48:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-08-04 21:48:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-08-04 21:48:15,314 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2019-08-04 21:48:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:15,314 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-08-04 21:48:15,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-04 21:48:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-08-04 21:48:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-08-04 21:48:15,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:15,316 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 96, 1, 1] [2019-08-04 21:48:15,316 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1432832666, now seen corresponding path program 96 times [2019-08-04 21:48:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:15,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-04 21:48:15,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:15,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:48:15,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:15,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:15,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:15,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13968 backedges. 0 proven. 13968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:19,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:19,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-04 21:48:19,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-04 21:48:19,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-04 21:48:19,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:48:19,893 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 99 states. [2019-08-04 21:48:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:20,368 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2019-08-04 21:48:20,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-04 21:48:20,369 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 292 [2019-08-04 21:48:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:20,371 INFO L225 Difference]: With dead ends: 296 [2019-08-04 21:48:20,371 INFO L226 Difference]: Without dead ends: 296 [2019-08-04 21:48:20,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:48:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-08-04 21:48:20,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-08-04 21:48:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-08-04 21:48:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-08-04 21:48:20,374 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2019-08-04 21:48:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:20,375 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-08-04 21:48:20,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-04 21:48:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-08-04 21:48:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-08-04 21:48:20,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:20,376 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 97, 1, 1] [2019-08-04 21:48:20,376 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:20,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2132663179, now seen corresponding path program 97 times [2019-08-04 21:48:20,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:20,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-04 21:48:20,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:20,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:48:20,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:20,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:20,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:20,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 0 proven. 14259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:24,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:24,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-04 21:48:24,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-04 21:48:24,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-04 21:48:24,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:48:24,735 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 100 states. [2019-08-04 21:48:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:25,165 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-08-04 21:48:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:48:25,166 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 295 [2019-08-04 21:48:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:25,168 INFO L225 Difference]: With dead ends: 299 [2019-08-04 21:48:25,168 INFO L226 Difference]: Without dead ends: 299 [2019-08-04 21:48:25,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:48:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-08-04 21:48:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2019-08-04 21:48:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-08-04 21:48:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-08-04 21:48:25,171 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2019-08-04 21:48:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:25,172 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2019-08-04 21:48:25,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-04 21:48:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2019-08-04 21:48:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-08-04 21:48:25,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:25,173 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 98, 1, 1] [2019-08-04 21:48:25,173 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1282746118, now seen corresponding path program 98 times [2019-08-04 21:48:25,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:25,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 300 conjunts are in the unsatisfiable core [2019-08-04 21:48:25,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:25,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:48:25,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:25,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:25,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:25,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14553 backedges. 0 proven. 14553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:29,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:29,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-04 21:48:29,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-04 21:48:29,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-04 21:48:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:48:29,587 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 101 states. [2019-08-04 21:48:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:29,976 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2019-08-04 21:48:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-04 21:48:29,977 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 298 [2019-08-04 21:48:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:29,978 INFO L225 Difference]: With dead ends: 302 [2019-08-04 21:48:29,979 INFO L226 Difference]: Without dead ends: 302 [2019-08-04 21:48:29,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:48:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-08-04 21:48:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-08-04 21:48:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-08-04 21:48:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-08-04 21:48:29,982 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2019-08-04 21:48:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:29,983 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2019-08-04 21:48:29,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-04 21:48:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2019-08-04 21:48:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-08-04 21:48:29,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:29,984 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 99, 1, 1] [2019-08-04 21:48:29,984 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1965870805, now seen corresponding path program 99 times [2019-08-04 21:48:29,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:30,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-04 21:48:30,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:30,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-04 21:48:30,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-04 21:48:30,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-04 21:48:30,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-04 21:48:30,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-04 21:48:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14850 backedges. 0 proven. 14850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:34,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:34,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-04 21:48:34,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-04 21:48:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-04 21:48:34,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:48:34,830 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 102 states. [2019-08-04 21:48:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:35,241 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-08-04 21:48:35,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-04 21:48:35,242 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 301 [2019-08-04 21:48:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:35,243 INFO L225 Difference]: With dead ends: 305 [2019-08-04 21:48:35,243 INFO L226 Difference]: Without dead ends: 305 [2019-08-04 21:48:35,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:48:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-04 21:48:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-08-04 21:48:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-08-04 21:48:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-08-04 21:48:35,247 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2019-08-04 21:48:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:35,247 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-08-04 21:48:35,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-04 21:48:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-08-04 21:48:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-08-04 21:48:35,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:48:35,249 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 100, 1, 1] [2019-08-04 21:48:35,249 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:48:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:48:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash -916594522, now seen corresponding path program 100 times [2019-08-04 21:48:35,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:48:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:48:35,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:48:35,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:48:41,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:48:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 15050 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:48:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:48:41,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-04 21:48:41,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-04 21:48:41,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-04 21:48:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:48:41,846 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 104 states. [2019-08-04 21:48:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:48:42,780 INFO L93 Difference]: Finished difference Result 303 states and 302 transitions. [2019-08-04 21:48:42,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-04 21:48:42,780 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 304 [2019-08-04 21:48:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:48:42,781 INFO L225 Difference]: With dead ends: 303 [2019-08-04 21:48:42,781 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:48:42,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5359, Invalid=5561, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:48:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:48:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:48:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:48:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:48:42,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 304 [2019-08-04 21:48:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:48:42,782 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:48:42,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-04 21:48:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:48:42,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:48:42,787 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:48:42 BoogieIcfgContainer [2019-08-04 21:48:42,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:48:42,788 INFO L168 Benchmark]: Toolchain (without parser) took 227215.97 ms. Allocated memory was 140.0 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 109.4 MB in the beginning and 525.8 MB in the end (delta: -416.4 MB). Peak memory consumption was 930.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:48:42,788 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:48:42,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.36 ms. Allocated memory is still 140.0 MB. Free memory was 109.4 MB in the beginning and 107.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:48:42,789 INFO L168 Benchmark]: Boogie Preprocessor took 24.42 ms. Allocated memory is still 140.0 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:48:42,789 INFO L168 Benchmark]: RCFGBuilder took 367.57 ms. Allocated memory is still 140.0 MB. Free memory was 106.2 MB in the beginning and 95.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:48:42,790 INFO L168 Benchmark]: TraceAbstraction took 226781.08 ms. Allocated memory was 140.0 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 95.3 MB in the beginning and 525.8 MB in the end (delta: -430.4 MB). Peak memory consumption was 916.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:48:42,791 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 140.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.36 ms. Allocated memory is still 140.0 MB. Free memory was 109.4 MB in the beginning and 107.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.42 ms. Allocated memory is still 140.0 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 367.57 ms. Allocated memory is still 140.0 MB. Free memory was 106.2 MB in the beginning and 95.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 226781.08 ms. Allocated memory was 140.0 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 95.3 MB in the beginning and 525.8 MB in the end (delta: -430.4 MB). Peak memory consumption was 916.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: 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, 7 locations, 1 error locations. SAFE Result, 226.7s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 3 SDslu, 5284 SDs, 0 SdLazy, 11949 SolverSat, 281 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15454 GetRequests, 10301 SyntacticMatches, 0 SemanticMatches, 5153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 179.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=100, 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.3s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 196.4s InterpolantComputationTime, 15554 NumberOfCodeBlocks, 15554 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 15453 ConstructedInterpolants, 0 QuantifiedInterpolants, 27861456 SizeOfPredicates, 202 NumberOfNonLiveVariables, 36865 ConjunctsInSsa, 15553 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 15050/515100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...