java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:30:45,642 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:30:45,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:30:45,662 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:30:45,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:30:45,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:30:45,665 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:30:45,667 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:30:45,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:30:45,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:30:45,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:30:45,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:30:45,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:30:45,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:30:45,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:30:45,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:30:45,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:30:45,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:30:45,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:30:45,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:30:45,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:30:45,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:30:45,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:30:45,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:30:45,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:30:45,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:30:45,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:30:45,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:30:45,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:30:45,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:30:45,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:30:45,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:30:45,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:30:45,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:30:45,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:30:45,707 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:30:45,707 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:30:45,724 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:30:45,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:30:45,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:30:45,727 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:30:45,727 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:30:45,728 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:30:45,728 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:30:45,728 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:30:45,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:30:45,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:30:45,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:30:45,835 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:30:45,836 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:30:45,837 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl [2018-07-25 13:30:45,837 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl' [2018-07-25 13:30:45,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:30:45,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:30:45,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:30:45,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:30:45,881 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:30:45,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,919 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:30:45,919 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:30:45,919 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:30:45,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:30:45,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:30:45,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:30:45,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:30:45,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:45,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:30:45,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:30:45,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:30:45,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:30:45,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/1) ... [2018-07-25 13:30:46,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 13:30:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 13:30:46,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 13:30:46,220 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:30:46,221 INFO L202 PluginConnector]: Adding new model HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:30:46 BoogieIcfgContainer [2018-07-25 13:30:46,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:30:46,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:30:46,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:30:46,226 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:30:46,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:45" (1/2) ... [2018-07-25 13:30:46,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec7a43a and model type HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:30:46, skipping insertion in model container [2018-07-25 13:30:46,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:30:46" (2/2) ... [2018-07-25 13:30:46,230 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEqualityWithBranches.bpl [2018-07-25 13:30:46,240 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:30:46,248 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:30:46,296 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:30:46,297 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:30:46,297 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:30:46,297 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:30:46,297 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:30:46,298 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:30:46,298 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:30:46,298 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:30:46,298 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:30:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-07-25 13:30:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-25 13:30:46,321 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,322 INFO L354 BasicCegarLoop]: trace histogram [1, 1] [2018-07-25 13:30:46,323 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,329 INFO L82 PathProgramCache]: Analyzing trace with hash 979, now seen corresponding path program 1 times [2018-07-25 13:30:46,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:46,399 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:30:46,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 13:30:46,403 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:30:46,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:30:46,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:30:46,419 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-07-25 13:30:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:46,448 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 13:30:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:30:46,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-25 13:30:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:46,473 INFO L225 Difference]: With dead ends: 7 [2018-07-25 13:30:46,473 INFO L226 Difference]: Without dead ends: 4 [2018-07-25 13:30:46,477 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:30:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-07-25 13:30:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-07-25 13:30:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-07-25 13:30:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-07-25 13:30:46,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-07-25 13:30:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:46,520 INFO L472 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-07-25 13:30:46,520 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:30:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-07-25 13:30:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:30:46,521 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,521 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:30:46,521 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash 30584, now seen corresponding path program 1 times [2018-07-25 13:30:46,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:46,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:46,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-25 13:30:46,544 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:30:46,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:30:46,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:30:46,546 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-07-25 13:30:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:46,564 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-07-25 13:30:46,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:30:46,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-25 13:30:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:46,566 INFO L225 Difference]: With dead ends: 6 [2018-07-25 13:30:46,566 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:30:46,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:30:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:30:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:30:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:30:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:30:46,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:30:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:46,573 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:30:46,573 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:30:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:30:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:30:46,574 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,574 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-07-25 13:30:46,575 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 948339, now seen corresponding path program 2 times [2018-07-25 13:30:46,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:46,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:46,631 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:30:46,631 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:30:46,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:30:46,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:30:46,632 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-25 13:30:46,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:46,648 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 13:30:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:30:46,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:30:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:46,649 INFO L225 Difference]: With dead ends: 7 [2018-07-25 13:30:46,650 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:30:46,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:30:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:30:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:30:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:30:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:30:46,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:30:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:46,654 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:30:46,654 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:30:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:30:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:30:46,654 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,655 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-07-25 13:30:46,655 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,655 INFO L82 PathProgramCache]: Analyzing trace with hash 29398744, now seen corresponding path program 3 times [2018-07-25 13:30:46,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:46,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:46,697 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:30:46,698 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:30:46,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:30:46,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:30:46,699 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 13:30:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:46,714 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:30:46,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:30:46,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 13:30:46,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:46,717 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:30:46,717 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:30:46,718 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:30:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:30:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:30:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:30:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:30:46,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:30:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:46,721 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:30:46,721 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:30:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:30:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:30:46,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,722 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-07-25 13:30:46,723 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash 911361299, now seen corresponding path program 4 times [2018-07-25 13:30:46,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:46,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:46,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:30:46,797 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:30:46,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:30:46,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:30:46,798 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-25 13:30:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:46,829 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:30:46,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:30:46,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:30:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:46,831 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:30:46,831 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:30:46,832 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:30:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:30:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:30:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:30:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:30:46,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:30:46,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:46,839 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:30:46,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:30:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:30:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:30:46,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,840 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-07-25 13:30:46,840 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1812570568, now seen corresponding path program 5 times [2018-07-25 13:30:46,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:46,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:46,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:30:46,922 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:30:46,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:30:46,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:30:46,923 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-25 13:30:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:46,935 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:30:46,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:30:46,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:30:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:46,936 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:30:46,936 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:30:46,937 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:30:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:30:46,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:30:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:30:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:30:46,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:30:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:46,941 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:30:46,941 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:30:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:30:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:30:46,941 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,941 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-07-25 13:30:46,942 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,942 INFO L82 PathProgramCache]: Analyzing trace with hash -355112525, now seen corresponding path program 6 times [2018-07-25 13:30:46,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:46,993 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:46,993 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:30:46,994 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:30:46,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:30:46,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:30:46,995 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-25 13:30:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,008 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:30:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:30:47,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-25 13:30:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,009 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:30:47,009 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:30:47,010 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:30:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:30:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:30:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:30:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:30:47,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:30:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,014 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:30:47,014 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:30:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:30:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:30:47,015 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,015 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-07-25 13:30:47,015 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1876413848, now seen corresponding path program 7 times [2018-07-25 13:30:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,105 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,105 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:30:47,109 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:30:47,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:30:47,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:30:47,111 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-25 13:30:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,141 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:30:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:30:47,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-25 13:30:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,143 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:30:47,145 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:30:47,145 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:30:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:30:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:30:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:30:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:30:47,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:30:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,152 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:30:47,152 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:30:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:30:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:30:47,153 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,153 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-07-25 13:30:47,154 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1960712621, now seen corresponding path program 8 times [2018-07-25 13:30:47,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,210 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:30:47,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:30:47,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:30:47,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:30:47,212 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-25 13:30:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,226 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:30:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:30:47,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-25 13:30:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,227 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:30:47,227 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:30:47,228 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:30:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:30:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:30:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:30:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:30:47,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:30:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,232 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:30:47,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:30:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:30:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:30:47,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,234 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-07-25 13:30:47,234 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,234 INFO L82 PathProgramCache]: Analyzing trace with hash -652548872, now seen corresponding path program 9 times [2018-07-25 13:30:47,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:30:47,318 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:30:47,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:30:47,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:30:47,319 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-25 13:30:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,334 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:30:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:30:47,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-25 13:30:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,335 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:30:47,335 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:30:47,336 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:30:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:30:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:30:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:30:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:30:47,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:30:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,340 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:30:47,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:30:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:30:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:30:47,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,341 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-07-25 13:30:47,342 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1245821683, now seen corresponding path program 10 times [2018-07-25 13:30:47,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,437 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:30:47,437 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:30:47,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:30:47,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:30:47,440 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-25 13:30:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,469 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:30:47,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:30:47,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-25 13:30:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,477 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:30:47,477 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:30:47,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:30:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:30:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:30:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:30:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:30:47,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:30:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,489 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:30:47,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:30:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:30:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:30:47,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,491 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-07-25 13:30:47,491 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash -34233256, now seen corresponding path program 11 times [2018-07-25 13:30:47,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,568 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,569 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:30:47,569 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:30:47,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:30:47,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:30:47,570 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-25 13:30:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,583 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:30:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:30:47,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-25 13:30:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,584 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:30:47,584 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:30:47,585 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:30:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:30:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:30:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:30:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:30:47,589 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:30:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,589 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:30:47,590 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:30:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:30:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:30:47,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,591 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-07-25 13:30:47,591 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1061230701, now seen corresponding path program 12 times [2018-07-25 13:30:47,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:30:47,655 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:30:47,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:30:47,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:30:47,656 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-07-25 13:30:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,671 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:30:47,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:30:47,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-07-25 13:30:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,672 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:30:47,672 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:30:47,673 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:30:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:30:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:30:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:30:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:30:47,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:30:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,678 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:30:47,678 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:30:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:30:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:30:47,679 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,679 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-07-25 13:30:47,680 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1461586872, now seen corresponding path program 13 times [2018-07-25 13:30:47,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:30:47,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:30:47,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:30:47,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:30:47,767 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-07-25 13:30:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,798 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:30:47,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:30:47,799 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-07-25 13:30:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,800 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:30:47,800 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:30:47,801 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:30:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:30:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:30:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:30:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:30:47,811 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:30:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,812 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:30:47,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:30:47,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:30:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:30:47,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,813 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-07-25 13:30:47,813 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1935446989, now seen corresponding path program 14 times [2018-07-25 13:30:47,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:30:47,913 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:30:47,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:30:47,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:30:47,914 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-07-25 13:30:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,931 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:30:47,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:30:47,931 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-07-25 13:30:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,932 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:30:47,932 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:30:47,933 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:30:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:30:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:30:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:30:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:30:47,942 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:30:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,942 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:30:47,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:30:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:30:47,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:30:47,943 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,944 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-07-25 13:30:47,944 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash 130685720, now seen corresponding path program 15 times [2018-07-25 13:30:47,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:30:48,028 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:30:48,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:30:48,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:30:48,032 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-07-25 13:30:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,051 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:30:48,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:30:48,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-07-25 13:30:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,053 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:30:48,053 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:30:48,054 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:30:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:30:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:30:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:30:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:30:48,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:30:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,068 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:30:48,068 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:30:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:30:48,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:30:48,069 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,069 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-07-25 13:30:48,069 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,070 INFO L82 PathProgramCache]: Analyzing trace with hash -243709741, now seen corresponding path program 16 times [2018-07-25 13:30:48,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:30:48,159 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:30:48,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:30:48,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:30:48,161 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-07-25 13:30:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,178 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:30:48,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:30:48,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-07-25 13:30:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,179 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:30:48,179 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:30:48,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:30:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:30:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:30:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:30:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:30:48,189 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:30:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,190 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:30:48,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:30:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:30:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:30:48,192 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,192 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-07-25 13:30:48,192 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1034932856, now seen corresponding path program 17 times [2018-07-25 13:30:48,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:30:48,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:30:48,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:30:48,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:30:48,281 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-07-25 13:30:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,297 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:30:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:30:48,297 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-07-25 13:30:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,298 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:30:48,298 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:30:48,299 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:30:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:30:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:30:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:30:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:30:48,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 13:30:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,303 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:30:48,304 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:30:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:30:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:30:48,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,305 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-07-25 13:30:48,305 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2018147699, now seen corresponding path program 18 times [2018-07-25 13:30:48,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:30:48,423 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:30:48,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:30:48,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:30:48,424 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-07-25 13:30:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,448 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:30:48,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:30:48,448 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-07-25 13:30:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,449 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:30:48,451 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 13:30:48,452 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:30:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 13:30:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 13:30:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:30:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:30:48,458 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 13:30:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,462 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:30:48,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:30:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:30:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:30:48,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,463 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-07-25 13:30:48,464 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1861930536, now seen corresponding path program 19 times [2018-07-25 13:30:48,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:30:48,584 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:30:48,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:30:48,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:30:48,586 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-07-25 13:30:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,610 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:30:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:30:48,611 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-07-25 13:30:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,612 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:30:48,612 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:30:48,613 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:30:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:30:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:30:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:30:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:30:48,624 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 13:30:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,624 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:30:48,624 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:30:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:30:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:30:48,626 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,626 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-07-25 13:30:48,627 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1885271533, now seen corresponding path program 20 times [2018-07-25 13:30:48,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:30:48,740 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:30:48,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:30:48,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:30:48,741 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-07-25 13:30:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,759 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:30:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:30:48,760 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-07-25 13:30:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,760 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:30:48,761 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:30:48,761 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:30:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:30:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 13:30:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:30:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:30:48,765 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 13:30:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,766 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:30:48,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:30:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:30:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:30:48,767 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,767 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-07-25 13:30:48,767 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1686124856, now seen corresponding path program 21 times [2018-07-25 13:30:48,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,890 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,890 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:30:48,891 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:30:48,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:30:48,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:30:48,892 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-07-25 13:30:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,910 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:30:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:30:48,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-07-25 13:30:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,911 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:30:48,911 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:30:48,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:30:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:30:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:30:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:30:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:30:48,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 13:30:48,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,916 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:30:48,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:30:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:30:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:30:48,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,917 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-07-25 13:30:48,918 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash 730263219, now seen corresponding path program 22 times [2018-07-25 13:30:48,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,056 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,056 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:30:49,056 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:30:49,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:30:49,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:30:49,057 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-07-25 13:30:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,076 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:30:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:30:49,076 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-07-25 13:30:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,077 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:30:49,077 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 13:30:49,078 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:30:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 13:30:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 13:30:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:30:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:30:49,082 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 13:30:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,082 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:30:49,082 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:30:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:30:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:30:49,083 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,083 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-07-25 13:30:49,083 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1163323544, now seen corresponding path program 23 times [2018-07-25 13:30:49,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,220 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:30:49,220 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:30:49,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:30:49,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:30:49,221 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-07-25 13:30:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,242 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:30:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:30:49,242 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-07-25 13:30:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,243 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:30:49,243 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:30:49,244 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:30:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:30:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:30:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:30:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:30:49,248 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 13:30:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,248 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:30:49,248 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:30:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:30:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:30:49,249 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,249 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-07-25 13:30:49,249 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1703291731, now seen corresponding path program 24 times [2018-07-25 13:30:49,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:30:49,392 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:30:49,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:30:49,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:30:49,393 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-07-25 13:30:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,410 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:30:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:30:49,410 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-07-25 13:30:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,411 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:30:49,411 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:30:49,412 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:30:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:30:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:30:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:30:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:30:49,416 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 13:30:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,416 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:30:49,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:30:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:30:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:30:49,417 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,418 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-07-25 13:30:49,418 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1262436344, now seen corresponding path program 25 times [2018-07-25 13:30:49,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,566 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,566 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:30:49,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:30:49,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:30:49,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:30:49,568 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-07-25 13:30:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,586 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:30:49,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:30:49,586 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-07-25 13:30:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,587 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:30:49,587 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:30:49,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:30:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:30:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:30:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:30:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:30:49,592 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 13:30:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,592 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:30:49,593 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:30:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:30:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:30:49,594 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,594 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-07-25 13:30:49,594 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 480821235, now seen corresponding path program 26 times [2018-07-25 13:30:49,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,744 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:30:49,745 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:30:49,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:30:49,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:30:49,746 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-07-25 13:30:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,769 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:30:49,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:30:49,770 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-07-25 13:30:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,770 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:30:49,770 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:30:49,771 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:30:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:30:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 13:30:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:30:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:30:49,775 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 13:30:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,776 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:30:49,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:30:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:30:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:30:49,777 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,777 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-07-25 13:30:49,777 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2020556632, now seen corresponding path program 27 times [2018-07-25 13:30:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,931 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,931 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:30:49,931 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:30:49,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:30:49,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:30:49,933 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-07-25 13:30:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,961 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:30:49,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:30:49,962 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-07-25 13:30:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,962 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:30:49,962 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:30:49,963 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:30:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:30:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:30:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:30:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:30:49,970 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 13:30:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,970 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:30:49,970 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:30:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:30:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:30:49,972 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,972 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-07-25 13:30:49,973 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1787253613, now seen corresponding path program 28 times [2018-07-25 13:30:49,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:50,138 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:50,138 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:30:50,138 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:30:50,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:30:50,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:30:50,140 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-07-25 13:30:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:50,162 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:30:50,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:30:50,162 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-07-25 13:30:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:50,163 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:30:50,163 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:30:50,164 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:30:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:30:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:30:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:30:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:30:50,174 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 13:30:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:50,174 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:30:50,174 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:30:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:30:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:30:50,175 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:50,175 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-07-25 13:30:50,178 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash 429713080, now seen corresponding path program 29 times [2018-07-25 13:30:50,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:50,437 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:50,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:30:50,438 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:30:50,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:30:50,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:30:50,439 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-07-25 13:30:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:50,460 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:30:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:30:50,460 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-07-25 13:30:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:50,461 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:30:50,461 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:30:50,462 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:30:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:30:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:30:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:30:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:30:50,472 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 13:30:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:50,472 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:30:50,472 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:30:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:30:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:30:50,473 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:50,473 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-07-25 13:30:50,474 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:50,474 INFO L82 PathProgramCache]: Analyzing trace with hash 436203827, now seen corresponding path program 30 times [2018-07-25 13:30:50,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:50,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:50,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:30:50,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:30:50,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:30:50,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:30:50,641 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-07-25 13:30:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:50,660 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:30:50,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:30:50,660 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-07-25 13:30:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:50,661 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:30:50,661 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:30:50,662 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:30:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:30:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 13:30:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:30:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:30:50,665 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 13:30:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:50,666 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:30:50,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:30:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:30:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:30:50,666 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:50,667 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-07-25 13:30:50,667 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash 637416984, now seen corresponding path program 31 times [2018-07-25 13:30:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:50,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:50,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:30:50,829 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:30:50,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:30:50,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:30:50,831 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-07-25 13:30:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:50,850 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:30:50,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:30:50,851 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-07-25 13:30:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:50,851 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:30:50,851 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:30:50,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:30:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:30:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:30:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:30:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:30:50,857 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 13:30:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:50,857 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:30:50,857 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:30:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:30:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:30:50,858 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:50,858 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-07-25 13:30:50,858 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1714909741, now seen corresponding path program 32 times [2018-07-25 13:30:50,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:51,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:51,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:30:51,046 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:30:51,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:30:51,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:30:51,047 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-07-25 13:30:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:51,068 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:30:51,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:30:51,068 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-07-25 13:30:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:51,068 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:30:51,069 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:30:51,070 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:30:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:30:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 13:30:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:30:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:30:51,074 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 13:30:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:51,080 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:30:51,080 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:30:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:30:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:30:51,081 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:51,081 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-07-25 13:30:51,081 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1622594184, now seen corresponding path program 33 times [2018-07-25 13:30:51,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:51,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:51,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:30:51,247 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:30:51,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:30:51,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:30:51,249 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-07-25 13:30:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:51,269 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:30:51,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:30:51,269 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-07-25 13:30:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:51,269 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:30:51,270 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:30:51,271 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:30:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:30:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:30:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:30:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:30:51,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 13:30:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:51,274 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:30:51,274 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:30:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:30:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:30:51,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:51,275 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-07-25 13:30:51,275 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:51,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1239188083, now seen corresponding path program 34 times [2018-07-25 13:30:51,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:51,441 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:51,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:30:51,441 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:30:51,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:30:51,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:30:51,443 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-07-25 13:30:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:51,466 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:30:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:30:51,466 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-07-25 13:30:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:51,467 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:30:51,467 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:30:51,468 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:30:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:30:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:30:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:30:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:30:51,471 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 13:30:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:51,471 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:30:51,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:30:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:30:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:30:51,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:51,472 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-07-25 13:30:51,472 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash -239874856, now seen corresponding path program 35 times [2018-07-25 13:30:51,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:51,656 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:51,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:30:51,657 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:30:51,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:30:51,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:30:51,659 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-07-25 13:30:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:51,681 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:30:51,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:30:51,681 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-07-25 13:30:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:51,682 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:30:51,682 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:30:51,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:30:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:30:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:30:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:30:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:30:51,686 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 13:30:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:51,686 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:30:51,692 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:30:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:30:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:30:51,693 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:51,693 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-07-25 13:30:51,693 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1153814291, now seen corresponding path program 36 times [2018-07-25 13:30:51,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:51,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:51,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:30:51,889 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:30:51,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:30:51,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:30:51,892 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-07-25 13:30:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:51,915 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:30:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:30:51,915 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-07-25 13:30:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:51,916 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:30:51,916 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 13:30:51,917 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:30:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 13:30:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 13:30:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:30:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:30:51,920 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 13:30:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:51,920 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:30:51,920 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:30:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:30:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:30:51,921 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:51,921 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-07-25 13:30:51,923 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1408504888, now seen corresponding path program 37 times [2018-07-25 13:30:51,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:52,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:52,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:30:52,122 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:30:52,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:30:52,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:30:52,124 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-07-25 13:30:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:52,148 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:30:52,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:30:52,149 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-07-25 13:30:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:52,149 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:30:52,149 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:30:52,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:30:52,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:30:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:30:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:30:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:30:52,153 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 13:30:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:52,153 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:30:52,153 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:30:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:30:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:30:52,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:52,155 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-07-25 13:30:52,155 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:52,155 INFO L82 PathProgramCache]: Analyzing trace with hash 713978803, now seen corresponding path program 38 times [2018-07-25 13:30:52,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:52,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:52,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:30:52,352 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:30:52,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:30:52,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:30:52,353 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-07-25 13:30:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:52,372 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:30:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:30:52,373 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-07-25 13:30:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:52,373 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:30:52,373 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 13:30:52,374 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:30:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 13:30:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 13:30:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:30:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:30:52,377 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 13:30:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:52,377 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:30:52,377 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:30:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:30:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:30:52,380 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:52,380 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-07-25 13:30:52,380 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash 658506648, now seen corresponding path program 39 times [2018-07-25 13:30:52,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:52,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:52,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:30:52,591 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:30:52,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:30:52,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:30:52,592 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-07-25 13:30:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:52,615 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:30:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:30:52,615 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-07-25 13:30:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:52,615 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:30:52,616 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:30:52,617 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:30:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:30:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:30:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:30:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:30:52,619 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 13:30:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:52,619 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:30:52,619 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:30:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:30:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:30:52,620 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:52,621 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-07-25 13:30:52,621 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1061130157, now seen corresponding path program 40 times [2018-07-25 13:30:52,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:52,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:52,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:30:52,853 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:30:52,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:30:52,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:30:52,855 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-07-25 13:30:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:52,883 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:30:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:30:52,883 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-07-25 13:30:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:52,884 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:30:52,884 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:30:52,885 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:30:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:30:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 13:30:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:30:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:30:52,888 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 13:30:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:52,889 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:30:52,889 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:30:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:30:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:30:52,889 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:52,890 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-07-25 13:30:52,890 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1464703736, now seen corresponding path program 41 times [2018-07-25 13:30:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:53,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:53,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:30:53,143 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:30:53,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:30:53,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:30:53,145 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-07-25 13:30:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:53,169 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:30:53,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:30:53,169 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-07-25 13:30:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:53,205 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:30:53,205 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:30:53,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:30:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:30:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:30:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:30:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:30:53,221 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 13:30:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:53,222 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:30:53,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:30:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:30:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:30:53,222 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:53,222 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-07-25 13:30:53,223 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1838824205, now seen corresponding path program 42 times [2018-07-25 13:30:53,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:53,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:53,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:30:53,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:30:53,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:30:53,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:30:53,438 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-07-25 13:30:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:53,465 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:30:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:30:53,466 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-07-25 13:30:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:53,466 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:30:53,466 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 13:30:53,469 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:30:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 13:30:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 13:30:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:30:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:30:53,473 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 13:30:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:53,473 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:30:53,473 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:30:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:30:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:30:53,474 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:53,474 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-07-25 13:30:53,474 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1168975272, now seen corresponding path program 43 times [2018-07-25 13:30:53,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:53,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:53,697 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:30:53,698 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:30:53,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:30:53,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:30:53,700 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-07-25 13:30:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:53,731 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 13:30:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:30:53,731 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-07-25 13:30:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:53,732 INFO L225 Difference]: With dead ends: 48 [2018-07-25 13:30:53,732 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:30:53,733 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:30:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:30:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:30:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:30:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:30:53,736 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 13:30:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:53,737 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:30:53,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:30:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:30:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:30:53,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:53,737 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-07-25 13:30:53,738 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1878494829, now seen corresponding path program 44 times [2018-07-25 13:30:53,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:53,984 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:53,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:30:53,984 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:30:53,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:30:53,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:30:53,986 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-07-25 13:30:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:54,012 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:30:54,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:30:54,012 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-07-25 13:30:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:54,013 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:30:54,013 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 13:30:54,014 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:30:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 13:30:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 13:30:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:30:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 13:30:54,016 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 13:30:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:54,016 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 13:30:54,016 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:30:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 13:30:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 13:30:54,017 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:54,017 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-07-25 13:30:54,018 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1896202680, now seen corresponding path program 45 times [2018-07-25 13:30:54,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:54,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:54,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:30:54,265 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:30:54,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:30:54,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:30:54,267 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-07-25 13:30:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:54,291 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:30:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:30:54,291 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-07-25 13:30:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:54,292 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:30:54,292 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:30:54,293 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:30:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:30:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:30:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:30:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:30:54,295 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 13:30:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:54,296 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:30:54,296 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:30:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:30:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:30:54,297 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:54,297 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-07-25 13:30:54,297 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1347258829, now seen corresponding path program 46 times [2018-07-25 13:30:54,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:54,534 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:54,534 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:30:54,534 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:30:54,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:30:54,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:30:54,536 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-07-25 13:30:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:54,565 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:30:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:30:54,566 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-07-25 13:30:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:54,566 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:30:54,566 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 13:30:54,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:30:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 13:30:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 13:30:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 13:30:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 13:30:54,570 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 13:30:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:54,570 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 13:30:54,570 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:30:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 13:30:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:30:54,571 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:54,571 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-07-25 13:30:54,571 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1184649496, now seen corresponding path program 47 times [2018-07-25 13:30:54,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:54,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:54,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:30:54,817 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:30:54,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:30:54,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:30:54,819 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-07-25 13:30:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:54,854 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 13:30:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:30:54,854 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-07-25 13:30:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:54,855 INFO L225 Difference]: With dead ends: 52 [2018-07-25 13:30:54,855 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:30:54,856 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:30:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:30:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:30:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:30:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:30:54,860 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 13:30:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:54,863 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:30:54,863 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:30:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:30:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:30:54,863 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:54,863 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-07-25 13:30:54,864 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1930571053, now seen corresponding path program 48 times [2018-07-25 13:30:54,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:55,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:55,119 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:30:55,119 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:30:55,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:30:55,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:30:55,121 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-07-25 13:30:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:55,152 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:30:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:30:55,152 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-07-25 13:30:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:55,153 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:30:55,153 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 13:30:55,154 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:30:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 13:30:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 13:30:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 13:30:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 13:30:55,159 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 13:30:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:55,159 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 13:30:55,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:30:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 13:30:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 13:30:55,160 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:55,160 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-07-25 13:30:55,160 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash 281839736, now seen corresponding path program 49 times [2018-07-25 13:30:55,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:55,411 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:55,412 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:30:55,412 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:30:55,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:30:55,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:30:55,414 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-07-25 13:30:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:55,447 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 13:30:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:30:55,447 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-07-25 13:30:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:55,448 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:30:55,448 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:30:55,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:30:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:30:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:30:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:30:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:30:55,452 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 13:30:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:55,452 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:30:55,452 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:30:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:30:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:30:55,453 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:55,453 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-07-25 13:30:55,453 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:55,454 INFO L82 PathProgramCache]: Analyzing trace with hash 147097459, now seen corresponding path program 50 times [2018-07-25 13:30:55,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:55,778 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:55,778 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:30:55,778 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:30:55,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:30:55,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:30:55,781 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-07-25 13:30:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:55,820 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:30:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:30:55,820 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-07-25 13:30:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:55,821 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:30:55,821 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 13:30:55,822 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:30:55,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 13:30:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 13:30:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 13:30:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 13:30:55,831 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 13:30:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:55,831 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 13:30:55,831 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:30:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 13:30:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 13:30:55,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:55,832 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-07-25 13:30:55,833 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash 265054168, now seen corresponding path program 51 times [2018-07-25 13:30:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:56,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:56,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:30:56,207 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:30:56,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:30:56,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:30:56,210 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-07-25 13:30:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:56,245 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 13:30:56,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:30:56,245 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-07-25 13:30:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:56,246 INFO L225 Difference]: With dead ends: 56 [2018-07-25 13:30:56,246 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:30:56,247 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:30:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:30:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:30:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:30:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:30:56,256 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 13:30:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:56,257 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:30:56,257 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:30:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:30:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:30:56,258 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:56,258 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-07-25 13:30:56,258 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:56,259 INFO L82 PathProgramCache]: Analyzing trace with hash -373255149, now seen corresponding path program 52 times [2018-07-25 13:30:56,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:56,594 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:56,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:30:56,594 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:30:56,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:30:56,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:30:56,596 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-07-25 13:30:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:56,634 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:30:56,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:30:56,634 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-07-25 13:30:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:56,635 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:30:56,635 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 13:30:56,636 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:30:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 13:30:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 13:30:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:30:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:30:56,639 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 13:30:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:56,640 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:30:56,640 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:30:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:30:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:30:56,640 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:56,641 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-07-25 13:30:56,641 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1313992504, now seen corresponding path program 53 times [2018-07-25 13:30:56,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:56,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:56,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:30:56,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:30:56,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:30:56,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:30:56,906 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-07-25 13:30:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:56,936 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 13:30:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:30:56,937 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-07-25 13:30:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:56,937 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:30:56,937 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:30:56,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:30:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:30:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:30:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:30:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:30:56,941 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 13:30:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:56,942 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:30:56,942 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:30:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:30:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:30:56,942 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:56,943 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-07-25 13:30:56,943 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2079062195, now seen corresponding path program 54 times [2018-07-25 13:30:56,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:57,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:57,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:30:57,225 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:30:57,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:30:57,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:30:57,227 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-07-25 13:30:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:57,263 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:30:57,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:30:57,263 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-07-25 13:30:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:57,264 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:30:57,264 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 13:30:57,265 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:30:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 13:30:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 13:30:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 13:30:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 13:30:57,268 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 13:30:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:57,269 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 13:30:57,269 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:30:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 13:30:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:30:57,272 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:57,272 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-07-25 13:30:57,272 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:57,273 INFO L82 PathProgramCache]: Analyzing trace with hash 26418840, now seen corresponding path program 55 times [2018-07-25 13:30:57,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:57,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:57,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:30:57,564 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:30:57,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:30:57,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:30:57,566 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-07-25 13:30:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:57,614 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:30:57,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:30:57,615 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-07-25 13:30:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:57,615 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:30:57,615 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:30:57,616 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:30:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:30:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:30:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:30:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:30:57,619 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 13:30:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:57,619 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:30:57,619 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:30:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:30:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:30:57,620 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:57,620 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-07-25 13:30:57,620 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:57,621 INFO L82 PathProgramCache]: Analyzing trace with hash 818984275, now seen corresponding path program 56 times [2018-07-25 13:30:57,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:57,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:57,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:30:57,913 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:30:57,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:30:57,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:30:57,914 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-07-25 13:30:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:57,958 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:30:57,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:30:57,958 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-07-25 13:30:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:57,959 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:30:57,959 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:30:57,960 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:30:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:30:57,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 13:30:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:30:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 13:30:57,963 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 13:30:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:57,963 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 13:30:57,963 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:30:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 13:30:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 13:30:57,964 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:57,964 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-07-25 13:30:57,965 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash -381291016, now seen corresponding path program 57 times [2018-07-25 13:30:57,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:58,270 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:58,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:30:58,270 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:30:58,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:30:58,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:30:58,272 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-07-25 13:30:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:58,307 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 13:30:58,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:30:58,308 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-07-25 13:30:58,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:58,308 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:30:58,308 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:30:58,309 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:30:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:30:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:30:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:30:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:30:58,312 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 13:30:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:58,313 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:30:58,313 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:30:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:30:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:30:58,314 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:58,314 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-07-25 13:30:58,314 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1064880627, now seen corresponding path program 58 times [2018-07-25 13:30:58,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:58,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:58,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:30:58,621 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:30:58,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:30:58,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:30:58,623 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-07-25 13:30:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:58,670 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:30:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:30:58,670 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-07-25 13:30:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:58,671 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:30:58,671 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 13:30:58,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:30:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 13:30:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 13:30:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 13:30:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 13:30:58,677 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 13:30:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:58,677 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 13:30:58,677 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:30:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 13:30:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 13:30:58,678 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:58,678 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-07-25 13:30:58,678 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1348438696, now seen corresponding path program 59 times [2018-07-25 13:30:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:58,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:58,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:30:59,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:30:59,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:30:59,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:30:59,002 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-07-25 13:30:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:59,045 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 13:30:59,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:30:59,045 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-07-25 13:30:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:59,046 INFO L225 Difference]: With dead ends: 64 [2018-07-25 13:30:59,046 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:30:59,048 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:30:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:30:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:30:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:30:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:30:59,051 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 13:30:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:59,052 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:30:59,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:30:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:30:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:30:59,053 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:59,053 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-07-25 13:30:59,053 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1148073619, now seen corresponding path program 60 times [2018-07-25 13:30:59,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:59,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:59,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:30:59,448 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:30:59,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:30:59,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:30:59,450 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-07-25 13:30:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:59,503 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:30:59,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:30:59,503 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-07-25 13:30:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:59,504 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:30:59,504 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 13:30:59,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:30:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 13:30:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 13:30:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 13:30:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 13:30:59,511 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 13:30:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:59,511 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 13:30:59,511 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:30:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 13:30:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 13:30:59,512 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:59,512 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-07-25 13:30:59,512 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1230544056, now seen corresponding path program 61 times [2018-07-25 13:30:59,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:59,887 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:59,887 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:30:59,887 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:30:59,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:30:59,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:30:59,889 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-07-25 13:30:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:59,931 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 13:30:59,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:30:59,932 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-07-25 13:30:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:59,933 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:30:59,933 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:30:59,934 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:30:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:30:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:30:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:30:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:30:59,938 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 13:30:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:59,938 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:30:59,938 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:30:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:30:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:30:59,939 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:59,939 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-07-25 13:30:59,939 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:59,939 INFO L82 PathProgramCache]: Analyzing trace with hash -507839693, now seen corresponding path program 62 times [2018-07-25 13:30:59,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:00,242 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:00,242 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:31:00,243 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:31:00,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:31:00,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:31:00,245 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-07-25 13:31:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:00,296 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:31:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:31:00,296 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-07-25 13:31:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:00,297 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:31:00,297 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 13:31:00,298 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:31:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 13:31:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 13:31:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:31:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:31:00,302 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 13:31:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:00,302 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:31:00,302 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:31:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:31:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:31:00,303 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:00,303 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-07-25 13:31:00,303 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1436838936, now seen corresponding path program 63 times [2018-07-25 13:31:00,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:00,627 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:00,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:31:00,628 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:31:00,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:31:00,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:31:00,630 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-07-25 13:31:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:00,667 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 13:31:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:31:00,667 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-07-25 13:31:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:00,668 INFO L225 Difference]: With dead ends: 68 [2018-07-25 13:31:00,668 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:31:00,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:31:00,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:31:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:31:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:31:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:31:00,675 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 13:31:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:00,675 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:31:00,675 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:31:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:31:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:31:00,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:00,677 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-07-25 13:31:00,677 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1592334291, now seen corresponding path program 64 times [2018-07-25 13:31:00,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:00,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:00,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:31:01,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:31:01,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:31:01,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:31:01,001 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-07-25 13:31:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:01,048 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:31:01,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:31:01,048 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-07-25 13:31:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:01,049 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:31:01,049 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 13:31:01,050 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:31:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 13:31:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 13:31:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 13:31:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 13:31:01,056 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 13:31:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:01,056 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 13:31:01,056 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:31:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 13:31:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:31:01,057 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:01,057 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-07-25 13:31:01,057 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2117723000, now seen corresponding path program 65 times [2018-07-25 13:31:01,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:01,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:01,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:31:01,392 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:31:01,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:31:01,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:31:01,393 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-07-25 13:31:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:01,446 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:31:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:31:01,446 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-07-25 13:31:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:01,447 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:31:01,447 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:31:01,448 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:31:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:31:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:31:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:31:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:31:01,451 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 13:31:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:01,451 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:31:01,452 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:31:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:31:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:31:01,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:01,452 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-07-25 13:31:01,453 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:01,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1224903795, now seen corresponding path program 66 times [2018-07-25 13:31:01,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:01,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:01,792 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:31:01,792 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:31:01,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:31:01,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:31:01,794 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-07-25 13:31:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:01,829 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:31:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:31:01,830 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-07-25 13:31:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:01,830 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:31:01,831 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 13:31:01,832 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:31:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 13:31:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 13:31:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:31:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 13:31:01,835 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 13:31:01,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:01,835 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 13:31:01,835 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:31:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 13:31:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:31:01,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:01,836 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-07-25 13:31:01,836 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:01,837 INFO L82 PathProgramCache]: Analyzing trace with hash -682687784, now seen corresponding path program 67 times [2018-07-25 13:31:01,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:02,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:02,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:31:02,205 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:31:02,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:31:02,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:31:02,207 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-07-25 13:31:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:02,267 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 13:31:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:31:02,268 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-07-25 13:31:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:02,268 INFO L225 Difference]: With dead ends: 72 [2018-07-25 13:31:02,268 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:31:02,269 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:31:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:31:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:31:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:31:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:31:02,272 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 13:31:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:02,272 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:31:02,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:31:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:31:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:31:02,273 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:02,273 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-07-25 13:31:02,274 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 311515411, now seen corresponding path program 68 times [2018-07-25 13:31:02,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:02,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:02,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:31:02,675 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:31:02,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:31:02,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:31:02,677 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-07-25 13:31:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:02,737 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:31:02,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:31:02,738 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-07-25 13:31:02,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:02,739 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:31:02,739 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 13:31:02,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:31:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 13:31:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 13:31:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:31:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 13:31:02,743 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 13:31:02,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:02,743 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 13:31:02,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:31:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 13:31:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 13:31:02,744 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:02,745 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-07-25 13:31:02,745 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1067043384, now seen corresponding path program 69 times [2018-07-25 13:31:02,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:03,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:03,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:31:03,118 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:31:03,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:31:03,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:31:03,121 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-07-25 13:31:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:03,188 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 13:31:03,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:31:03,189 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-07-25 13:31:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:03,190 INFO L225 Difference]: With dead ends: 74 [2018-07-25 13:31:03,190 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:31:03,191 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:31:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:31:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:31:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:31:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:31:03,195 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 13:31:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:03,195 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:31:03,195 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:31:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:31:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:31:03,196 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:03,196 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-07-25 13:31:03,196 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:03,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1281393229, now seen corresponding path program 70 times [2018-07-25 13:31:03,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:03,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:03,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:31:03,549 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:31:03,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:31:03,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:31:03,555 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-07-25 13:31:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:03,612 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:31:03,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:31:03,612 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-07-25 13:31:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:03,613 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:31:03,613 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 13:31:03,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:31:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 13:31:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 13:31:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:31:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 13:31:03,617 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 13:31:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:03,618 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 13:31:03,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:31:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 13:31:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:31:03,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:03,619 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-07-25 13:31:03,619 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1068484200, now seen corresponding path program 71 times [2018-07-25 13:31:03,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:03,987 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:03,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:31:03,988 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:31:03,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:31:03,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:31:03,994 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-07-25 13:31:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:04,051 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 13:31:04,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:31:04,052 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-07-25 13:31:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:04,052 INFO L225 Difference]: With dead ends: 76 [2018-07-25 13:31:04,053 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:31:04,054 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:31:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:31:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:31:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:31:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:31:04,057 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 13:31:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:04,057 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:31:04,057 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:31:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:31:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:31:04,058 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:04,058 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-07-25 13:31:04,058 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1236728403, now seen corresponding path program 72 times [2018-07-25 13:31:04,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:04,394 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:04,394 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:31:04,394 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:31:04,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:31:04,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:31:04,396 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-07-25 13:31:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:04,438 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:31:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:31:04,439 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-07-25 13:31:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:04,439 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:31:04,440 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:31:04,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:31:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:31:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 13:31:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:31:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:31:04,444 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 13:31:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:04,444 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:31:04,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:31:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:31:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:31:04,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:04,445 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-07-25 13:31:04,445 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash -316124936, now seen corresponding path program 73 times [2018-07-25 13:31:04,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:04,772 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:04,772 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:31:04,772 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:31:04,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:31:04,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:31:04,774 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-07-25 13:31:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:04,815 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 13:31:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:31:04,816 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-07-25 13:31:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:04,816 INFO L225 Difference]: With dead ends: 78 [2018-07-25 13:31:04,817 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:31:04,818 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:31:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:31:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:31:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:31:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:31:04,821 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 13:31:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:04,821 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:31:04,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:31:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:31:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:31:04,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:04,823 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-07-25 13:31:04,823 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:04,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1209938189, now seen corresponding path program 74 times [2018-07-25 13:31:04,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:05,263 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:05,263 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:31:05,263 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:31:05,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:31:05,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:31:05,266 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-07-25 13:31:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:05,311 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:31:05,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:31:05,311 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-07-25 13:31:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:05,312 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:31:05,312 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:31:05,313 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:31:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:31:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 13:31:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:31:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 13:31:05,317 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 13:31:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:05,318 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 13:31:05,318 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:31:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 13:31:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 13:31:05,319 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:05,319 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-07-25 13:31:05,319 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1146622040, now seen corresponding path program 75 times [2018-07-25 13:31:05,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:05,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:05,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:31:05,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:31:05,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:31:05,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:31:05,742 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-07-25 13:31:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:05,790 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:31:05,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:31:05,791 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-07-25 13:31:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:05,791 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:31:05,792 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:31:05,792 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:31:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:31:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:31:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:31:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:31:05,796 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 13:31:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:05,796 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:31:05,796 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:31:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:31:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:31:05,797 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:05,797 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-07-25 13:31:05,797 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:05,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1185545107, now seen corresponding path program 76 times [2018-07-25 13:31:05,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:06,131 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:06,132 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:31:06,132 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:31:06,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:31:06,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:31:06,134 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-07-25 13:31:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:06,195 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:31:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:31:06,196 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-07-25 13:31:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:06,196 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:31:06,196 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 13:31:06,197 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:31:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 13:31:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 13:31:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:31:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 13:31:06,201 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 13:31:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:06,201 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 13:31:06,201 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:31:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 13:31:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:31:06,202 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:06,202 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-07-25 13:31:06,202 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1902807112, now seen corresponding path program 77 times [2018-07-25 13:31:06,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:06,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:06,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:31:06,522 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:31:06,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:31:06,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:31:06,524 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-07-25 13:31:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:06,602 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 13:31:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:31:06,602 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-07-25 13:31:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:06,603 INFO L225 Difference]: With dead ends: 82 [2018-07-25 13:31:06,603 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:31:06,604 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:31:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:31:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:31:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:31:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:31:06,608 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 13:31:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:06,608 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:31:06,608 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:31:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:31:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:31:06,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:06,609 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-07-25 13:31:06,609 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1142521907, now seen corresponding path program 78 times [2018-07-25 13:31:06,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:06,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:06,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:31:06,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:31:06,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:31:06,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:31:06,951 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-07-25 13:31:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:07,022 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:31:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:31:07,023 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-07-25 13:31:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:07,024 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:31:07,024 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:31:07,025 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:31:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:31:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 13:31:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 13:31:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 13:31:07,028 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 13:31:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:07,028 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 13:31:07,028 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:31:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 13:31:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 13:31:07,029 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:07,029 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-07-25 13:31:07,030 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1058440984, now seen corresponding path program 79 times [2018-07-25 13:31:07,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:07,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:07,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:31:07,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:31:07,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:31:07,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:31:07,343 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-07-25 13:31:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:07,405 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 13:31:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:31:07,405 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-07-25 13:31:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:07,406 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:31:07,406 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:31:07,407 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:31:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:31:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:31:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:31:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:31:07,410 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 13:31:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:07,410 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:31:07,410 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:31:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:31:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:31:07,411 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:07,411 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-07-25 13:31:07,412 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:07,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1548067629, now seen corresponding path program 80 times [2018-07-25 13:31:07,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:07,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:07,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:31:07,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:31:07,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:31:07,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:31:07,767 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-07-25 13:31:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:07,806 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:31:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:31:07,807 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-07-25 13:31:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:07,807 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:31:07,807 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 13:31:07,808 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:31:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 13:31:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 13:31:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:31:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 13:31:07,811 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 13:31:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:07,812 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 13:31:07,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:31:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 13:31:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 13:31:07,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:07,813 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-07-25 13:31:07,813 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -745456008, now seen corresponding path program 81 times [2018-07-25 13:31:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:08,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:08,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:31:08,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:31:08,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:31:08,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:31:08,236 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-07-25 13:31:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:08,315 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 13:31:08,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:31:08,316 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-07-25 13:31:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:08,316 INFO L225 Difference]: With dead ends: 86 [2018-07-25 13:31:08,317 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:31:08,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:31:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:31:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:31:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:31:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:31:08,320 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 13:31:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:08,321 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:31:08,321 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:31:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:31:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:31:08,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:08,322 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-07-25 13:31:08,322 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:08,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1634299533, now seen corresponding path program 82 times [2018-07-25 13:31:08,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:08,647 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:08,647 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:31:08,647 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:31:08,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:31:08,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:31:08,648 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-07-25 13:31:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:08,713 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:31:08,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:31:08,713 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-07-25 13:31:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:08,714 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:31:08,714 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 13:31:08,715 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:31:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 13:31:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 13:31:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:31:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:31:08,720 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 13:31:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:08,720 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:31:08,720 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:31:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:31:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:31:08,721 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:08,721 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-07-25 13:31:08,721 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 876322264, now seen corresponding path program 83 times [2018-07-25 13:31:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:09,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:09,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:31:09,044 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:31:09,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:31:09,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:31:09,046 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-07-25 13:31:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:09,089 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 13:31:09,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:31:09,090 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-07-25 13:31:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:09,090 INFO L225 Difference]: With dead ends: 88 [2018-07-25 13:31:09,090 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:31:09,091 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:31:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:31:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:31:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:31:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:31:09,094 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 13:31:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:09,095 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:31:09,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:31:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:31:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:31:09,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:09,096 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-07-25 13:31:09,096 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1396186643, now seen corresponding path program 84 times [2018-07-25 13:31:09,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:09,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:09,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:31:09,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:31:09,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:31:09,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:31:09,462 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-07-25 13:31:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:09,559 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:31:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:31:09,560 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-07-25 13:31:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:09,560 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:31:09,561 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 13:31:09,562 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:31:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 13:31:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 13:31:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 13:31:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 13:31:09,565 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 13:31:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:09,566 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 13:31:09,566 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:31:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 13:31:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 13:31:09,566 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:09,567 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-07-25 13:31:09,567 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash 332113208, now seen corresponding path program 85 times [2018-07-25 13:31:09,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:09,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:09,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:31:09,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:31:09,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:31:09,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:31:09,994 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-07-25 13:31:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:10,057 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:31:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:31:10,057 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-07-25 13:31:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:10,058 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:31:10,058 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:31:10,059 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:31:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:31:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:31:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:31:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:31:10,063 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 13:31:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:10,063 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:31:10,063 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:31:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:31:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:31:10,064 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:10,064 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-07-25 13:31:10,064 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1705575091, now seen corresponding path program 86 times [2018-07-25 13:31:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:10,544 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:10,544 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:31:10,545 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:31:10,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:31:10,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:31:10,546 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-07-25 13:31:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:10,632 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:31:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:31:10,633 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-07-25 13:31:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:10,633 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:31:10,633 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 13:31:10,635 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:31:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 13:31:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 13:31:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 13:31:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 13:31:10,638 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 13:31:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:10,638 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 13:31:10,638 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:31:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 13:31:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 13:31:10,639 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:10,639 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-07-25 13:31:10,639 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1333220504, now seen corresponding path program 87 times [2018-07-25 13:31:10,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:11,182 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:11,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:31:11,183 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:31:11,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:31:11,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:31:11,185 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-07-25 13:31:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:11,249 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 13:31:11,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:31:11,250 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-07-25 13:31:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:11,251 INFO L225 Difference]: With dead ends: 92 [2018-07-25 13:31:11,251 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:31:11,252 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:31:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:31:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:31:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:31:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:31:11,256 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 13:31:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:11,257 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:31:11,257 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:31:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:31:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:31:11,258 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:11,258 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-07-25 13:31:11,258 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1619837101, now seen corresponding path program 88 times [2018-07-25 13:31:11,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:11,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:11,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:31:11,864 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:31:11,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:31:11,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:31:11,866 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-07-25 13:31:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:11,965 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:31:11,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:31:11,965 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-07-25 13:31:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:11,966 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:31:11,966 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 13:31:11,968 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:31:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 13:31:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 13:31:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 13:31:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 13:31:11,977 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 13:31:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:11,978 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 13:31:11,978 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:31:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 13:31:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 13:31:11,981 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:11,981 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-07-25 13:31:11,981 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1324657656, now seen corresponding path program 89 times [2018-07-25 13:31:11,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:12,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:12,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:31:12,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:31:12,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:31:12,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:31:12,293 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-07-25 13:31:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:12,335 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 13:31:12,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:31:12,336 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-07-25 13:31:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:12,337 INFO L225 Difference]: With dead ends: 94 [2018-07-25 13:31:12,337 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:31:12,338 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:31:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:31:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:31:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:31:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:31:12,341 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 13:31:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:12,342 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:31:12,342 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:31:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:31:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:31:12,342 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:12,343 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-07-25 13:31:12,343 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:12,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1885285389, now seen corresponding path program 90 times [2018-07-25 13:31:12,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:12,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:12,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:31:12,752 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:31:12,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:31:12,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:31:12,754 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-07-25 13:31:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:12,845 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:31:12,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:31:12,846 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-07-25 13:31:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:12,847 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:31:12,847 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 13:31:12,848 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:31:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 13:31:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 13:31:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 13:31:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 13:31:12,851 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 13:31:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:12,852 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 13:31:12,852 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:31:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 13:31:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 13:31:12,852 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:12,853 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-07-25 13:31:12,853 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1685695320, now seen corresponding path program 91 times [2018-07-25 13:31:12,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:13,187 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:13,187 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:31:13,187 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:31:13,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:31:13,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:31:13,189 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-07-25 13:31:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:13,272 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 13:31:13,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:31:13,273 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-07-25 13:31:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:13,273 INFO L225 Difference]: With dead ends: 96 [2018-07-25 13:31:13,274 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:31:13,275 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:31:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:31:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:31:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:31:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:31:13,278 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 13:31:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:13,278 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:31:13,278 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:31:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:31:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:31:13,279 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:13,279 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-07-25 13:31:13,279 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:13,279 INFO L82 PathProgramCache]: Analyzing trace with hash 716947603, now seen corresponding path program 92 times [2018-07-25 13:31:13,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:13,613 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:13,614 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:31:13,614 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:31:13,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:31:13,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:31:13,616 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-07-25 13:31:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:13,662 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:31:13,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:31:13,663 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-07-25 13:31:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:13,663 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:31:13,663 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 13:31:13,664 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:31:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 13:31:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 13:31:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:31:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 13:31:13,667 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 13:31:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:13,667 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 13:31:13,667 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:31:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 13:31:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:31:13,668 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:13,668 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-07-25 13:31:13,668 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash 750539448, now seen corresponding path program 93 times [2018-07-25 13:31:13,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:14,021 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:14,021 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:31:14,021 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:31:14,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:31:14,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:31:14,022 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-07-25 13:31:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:14,063 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 13:31:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:31:14,063 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-07-25 13:31:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:14,063 INFO L225 Difference]: With dead ends: 98 [2018-07-25 13:31:14,064 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:31:14,064 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:31:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:31:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:31:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:31:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:31:14,066 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 13:31:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:14,067 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:31:14,067 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:31:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:31:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:31:14,067 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:14,067 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-07-25 13:31:14,067 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1791886643, now seen corresponding path program 94 times [2018-07-25 13:31:14,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:14,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:14,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:31:14,452 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:31:14,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:31:14,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:31:14,454 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-07-25 13:31:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:14,519 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:31:14,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:31:14,519 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-07-25 13:31:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:14,520 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:31:14,520 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 13:31:14,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:31:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 13:31:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 13:31:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 13:31:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 13:31:14,523 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 13:31:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:14,524 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 13:31:14,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:31:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 13:31:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 13:31:14,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:14,524 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-07-25 13:31:14,524 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash -286088680, now seen corresponding path program 95 times [2018-07-25 13:31:14,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:14,890 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:14,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:31:14,891 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:31:14,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:31:14,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:31:14,893 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-07-25 13:31:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:14,986 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 13:31:14,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:31:14,986 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-07-25 13:31:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:14,987 INFO L225 Difference]: With dead ends: 100 [2018-07-25 13:31:14,987 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:31:14,989 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:31:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:31:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:31:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:31:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:31:14,991 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 13:31:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:14,992 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:31:14,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:31:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:31:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:31:14,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:14,993 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-07-25 13:31:14,993 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:14,993 INFO L82 PathProgramCache]: Analyzing trace with hash -278814253, now seen corresponding path program 96 times [2018-07-25 13:31:14,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:15,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:15,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:31:15,366 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:31:15,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:31:15,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:31:15,367 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-07-25 13:31:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:15,462 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:31:15,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:31:15,462 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-07-25 13:31:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:15,463 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:31:15,463 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 13:31:15,464 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:31:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 13:31:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 13:31:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:31:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 13:31:15,467 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 13:31:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:15,467 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 13:31:15,467 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:31:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 13:31:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 13:31:15,468 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:15,468 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-07-25 13:31:15,468 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash -53307016, now seen corresponding path program 97 times [2018-07-25 13:31:15,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:15,799 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:15,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:31:15,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:31:15,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:31:15,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:31:15,801 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-07-25 13:31:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:15,880 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 13:31:15,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:31:15,880 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-07-25 13:31:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:15,881 INFO L225 Difference]: With dead ends: 102 [2018-07-25 13:31:15,881 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:31:15,882 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:31:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:31:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:31:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:31:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:31:15,885 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 13:31:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:15,885 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:31:15,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:31:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:31:15,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:31:15,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:15,886 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-07-25 13:31:15,886 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:15,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1652517261, now seen corresponding path program 98 times [2018-07-25 13:31:15,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:16,337 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:16,337 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:31:16,338 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:31:16,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:31:16,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:31:16,339 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-07-25 13:31:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:16,416 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:31:16,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:31:16,416 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-07-25 13:31:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:16,417 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:31:16,417 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 13:31:16,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:31:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 13:31:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 13:31:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 13:31:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 13:31:16,421 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 13:31:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:16,422 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 13:31:16,422 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:31:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 13:31:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 13:31:16,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:16,423 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-07-25 13:31:16,423 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:16,423 INFO L82 PathProgramCache]: Analyzing trace with hash 311572696, now seen corresponding path program 99 times [2018-07-25 13:31:16,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:16,766 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:16,766 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:31:16,767 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:31:16,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:31:16,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:31:16,768 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-07-25 13:31:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:16,839 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 13:31:16,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:31:16,839 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-07-25 13:31:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:16,840 INFO L225 Difference]: With dead ends: 104 [2018-07-25 13:31:16,840 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:31:16,841 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:31:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:31:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:31:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:31:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:31:16,844 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 13:31:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:16,844 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:31:16,844 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:31:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:31:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:31:16,845 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:16,845 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-07-25 13:31:16,845 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1068819219, now seen corresponding path program 100 times [2018-07-25 13:31:16,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:18,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:18,362 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:31:18,362 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:31:18,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:31:18,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:31:18,364 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-07-25 13:31:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:19,587 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:31:19,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:31:19,587 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-07-25 13:31:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:19,588 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:31:19,588 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 13:31:19,589 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:31:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 13:31:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 13:31:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 13:31:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 13:31:19,595 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 13:31:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:19,596 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 13:31:19,596 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:31:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 13:31:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 13:31:19,597 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:19,597 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-07-25 13:31:19,597 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:19,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1226342344, now seen corresponding path program 101 times [2018-07-25 13:31:19,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:20,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:20,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:31:20,500 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:31:20,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:31:20,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:31:20,502 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-07-25 13:31:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:21,433 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 13:31:21,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:31:21,433 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-07-25 13:31:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:21,434 INFO L225 Difference]: With dead ends: 106 [2018-07-25 13:31:21,434 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:31:21,435 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:31:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:31:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:31:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:31:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:31:21,442 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 13:31:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:21,443 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:31:21,443 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:31:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:31:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:31:21,443 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:21,443 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1] [2018-07-25 13:31:21,444 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 638093235, now seen corresponding path program 102 times [2018-07-25 13:31:21,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:22,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:22,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:31:22,457 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:31:22,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:31:22,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:31:22,458 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2018-07-25 13:31:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:23,586 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:31:23,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:31:23,586 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-07-25 13:31:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:23,587 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:31:23,587 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 13:31:23,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:31:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 13:31:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 13:31:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 13:31:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 13:31:23,596 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 13:31:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:23,596 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 13:31:23,596 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:31:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 13:31:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 13:31:23,597 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:23,597 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1] [2018-07-25 13:31:23,597 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1693945960, now seen corresponding path program 103 times [2018-07-25 13:31:23,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:24,455 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:24,455 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:31:24,455 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:31:24,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:31:24,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:31:24,457 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-07-25 13:31:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:25,153 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 13:31:25,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:31:25,153 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-07-25 13:31:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:25,154 INFO L225 Difference]: With dead ends: 108 [2018-07-25 13:31:25,154 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:31:25,155 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:31:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:31:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:31:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:31:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:31:25,162 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 13:31:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:25,163 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:31:25,163 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:31:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:31:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:31:25,164 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:25,164 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1] [2018-07-25 13:31:25,164 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:25,164 INFO L82 PathProgramCache]: Analyzing trace with hash -972716973, now seen corresponding path program 104 times [2018-07-25 13:31:25,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:26,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:26,006 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:31:26,006 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:31:26,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:31:26,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:31:26,007 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2018-07-25 13:31:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:26,792 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:31:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:31:26,792 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2018-07-25 13:31:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:26,793 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:31:26,793 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 13:31:26,794 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:31:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 13:31:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 13:31:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 13:31:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 13:31:26,801 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 13:31:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:26,802 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 13:31:26,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:31:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 13:31:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 13:31:26,803 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:26,803 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1] [2018-07-25 13:31:26,803 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash -89454856, now seen corresponding path program 105 times [2018-07-25 13:31:26,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:27,488 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:27,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:31:27,489 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:31:27,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:31:27,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:31:27,490 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-07-25 13:31:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:28,204 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 13:31:28,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:31:28,205 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-07-25 13:31:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:28,205 INFO L225 Difference]: With dead ends: 110 [2018-07-25 13:31:28,205 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:31:28,206 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:31:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:31:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:31:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:31:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:31:28,211 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 13:31:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:28,211 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:31:28,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:31:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:31:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:31:28,212 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:28,212 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1] [2018-07-25 13:31:28,212 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1521866995, now seen corresponding path program 106 times [2018-07-25 13:31:28,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:28,800 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:28,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:31:28,800 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:31:28,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:31:28,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:31:28,802 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2018-07-25 13:31:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:29,544 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:31:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:31:29,544 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2018-07-25 13:31:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:29,545 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:31:29,545 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 13:31:29,547 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:31:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 13:31:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 13:31:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 13:31:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 13:31:29,553 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 13:31:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:29,554 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 13:31:29,554 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:31:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 13:31:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 13:31:29,555 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:29,555 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1] [2018-07-25 13:31:29,555 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:29,555 INFO L82 PathProgramCache]: Analyzing trace with hash -66763176, now seen corresponding path program 107 times [2018-07-25 13:31:29,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:30,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:30,248 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:31:30,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:31:30,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:31:30,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:31:30,249 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-07-25 13:31:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:31,030 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 13:31:31,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:31:31,030 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-07-25 13:31:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:31,031 INFO L225 Difference]: With dead ends: 112 [2018-07-25 13:31:31,031 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:31:31,032 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:31:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:31:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:31:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:31:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:31:31,039 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 13:31:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:31,040 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:31:31,040 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:31:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:31:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:31:31,041 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:31,041 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1] [2018-07-25 13:31:31,041 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:31,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2069658221, now seen corresponding path program 108 times [2018-07-25 13:31:31,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:31,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:31,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:31:31,781 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:31:31,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:31:31,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:31:31,783 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2018-07-25 13:31:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:32,537 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:31:32,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:31:32,537 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2018-07-25 13:31:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:32,538 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:31:32,538 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 13:31:32,539 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:31:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 13:31:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 13:31:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 13:31:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 13:31:32,544 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 13:31:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:32,545 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 13:31:32,545 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:31:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 13:31:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 13:31:32,545 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:32,546 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1] [2018-07-25 13:31:32,546 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:32,546 INFO L82 PathProgramCache]: Analyzing trace with hash 265104824, now seen corresponding path program 109 times [2018-07-25 13:31:32,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:33,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:33,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:31:33,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:31:33,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:31:33,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:31:33,290 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-07-25 13:31:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:34,082 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 13:31:34,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:31:34,082 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-07-25 13:31:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:34,083 INFO L225 Difference]: With dead ends: 114 [2018-07-25 13:31:34,083 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:31:34,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:31:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:31:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:31:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:31:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:31:34,091 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 13:31:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:34,092 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:31:34,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:31:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:31:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:31:34,092 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:34,093 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1] [2018-07-25 13:31:34,093 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash -371684813, now seen corresponding path program 110 times [2018-07-25 13:31:34,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:34,900 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:34,900 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:31:34,900 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:31:34,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:31:34,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:31:34,901 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2018-07-25 13:31:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:35,673 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:31:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:31:35,673 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2018-07-25 13:31:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:35,674 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:31:35,674 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 13:31:35,675 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:31:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 13:31:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 13:31:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 13:31:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 13:31:35,682 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 13:31:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:35,682 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 13:31:35,682 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:31:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 13:31:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 13:31:35,683 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:35,683 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1] [2018-07-25 13:31:35,683 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:35,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1362672920, now seen corresponding path program 111 times [2018-07-25 13:31:35,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:36,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:36,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:31:36,296 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:31:36,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:31:36,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:31:36,297 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-07-25 13:31:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:37,108 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 13:31:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:31:37,108 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-07-25 13:31:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:37,109 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:31:37,109 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:31:37,110 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:31:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:31:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:31:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:31:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:31:37,117 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 13:31:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:37,117 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:31:37,118 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:31:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:31:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:31:37,118 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:37,118 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1] [2018-07-25 13:31:37,119 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash -706812205, now seen corresponding path program 112 times [2018-07-25 13:31:37,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:37,718 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:37,719 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:31:37,719 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:31:37,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:31:37,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:31:37,720 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2018-07-25 13:31:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:38,605 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:31:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:31:38,605 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2018-07-25 13:31:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:38,606 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:31:38,606 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 13:31:38,606 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:31:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 13:31:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 13:31:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 13:31:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 13:31:38,612 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 13:31:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:38,612 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 13:31:38,612 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:31:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 13:31:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 13:31:38,613 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:38,613 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1] [2018-07-25 13:31:38,613 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash -436341640, now seen corresponding path program 113 times [2018-07-25 13:31:38,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:39,197 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:39,197 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:31:39,197 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:31:39,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:31:39,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:31:39,198 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-07-25 13:31:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:40,065 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 13:31:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:31:40,066 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-07-25 13:31:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:40,066 INFO L225 Difference]: With dead ends: 118 [2018-07-25 13:31:40,066 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:31:40,068 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:31:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:31:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:31:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:31:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:31:40,075 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 13:31:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:40,076 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:31:40,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:31:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:31:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:31:40,076 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:40,077 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1] [2018-07-25 13:31:40,077 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash -641688717, now seen corresponding path program 114 times [2018-07-25 13:31:40,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:40,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:40,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:31:40,834 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:31:40,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:31:40,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:31:40,835 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2018-07-25 13:31:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:41,684 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:31:41,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:31:41,684 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-07-25 13:31:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:41,685 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:31:41,685 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 13:31:41,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:31:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 13:31:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 13:31:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 13:31:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 13:31:41,695 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 13:31:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:41,695 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 13:31:41,695 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:31:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 13:31:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 13:31:41,696 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:41,696 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1] [2018-07-25 13:31:41,696 INFO L415 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1582486488, now seen corresponding path program 115 times [2018-07-25 13:31:41,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:42,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:42,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:31:42,518 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:31:42,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:31:42,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:31:42,518 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-07-25 13:31:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:43,355 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 13:31:43,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:31:43,355 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-07-25 13:31:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:43,356 INFO L225 Difference]: With dead ends: 120 [2018-07-25 13:31:43,356 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:31:43,356 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:31:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:31:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:31:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:31:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:31:43,361 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 13:31:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:43,362 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:31:43,362 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:31:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:31:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:31:43,363 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:43,363 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1] [2018-07-25 13:31:43,363 INFO L415 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1812441107, now seen corresponding path program 116 times [2018-07-25 13:31:43,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:43,994 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:43,994 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:31:43,995 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:31:43,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:31:43,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:31:43,996 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2018-07-25 13:31:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:45,170 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:31:45,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:31:45,170 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 118 [2018-07-25 13:31:45,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:45,171 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:31:45,171 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 13:31:45,172 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:31:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 13:31:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 13:31:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 13:31:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 13:31:45,177 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 13:31:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:45,177 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 13:31:45,178 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:31:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 13:31:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 13:31:45,178 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:45,178 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1] [2018-07-25 13:31:45,178 INFO L415 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:45,178 INFO L82 PathProgramCache]: Analyzing trace with hash 351099704, now seen corresponding path program 117 times [2018-07-25 13:31:45,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:45,828 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:45,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:31:45,829 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:31:45,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:31:45,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:31:45,830 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-07-25 13:31:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:46,742 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 13:31:46,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:31:46,743 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-07-25 13:31:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:46,743 INFO L225 Difference]: With dead ends: 122 [2018-07-25 13:31:46,743 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:31:46,744 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:31:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:31:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:31:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:31:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:31:46,748 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 13:31:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:46,749 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:31:46,749 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:31:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:31:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:31:46,749 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:46,750 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1] [2018-07-25 13:31:46,750 INFO L415 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2000810829, now seen corresponding path program 118 times [2018-07-25 13:31:46,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:47,449 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:47,449 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:31:47,450 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:31:47,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:31:47,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:31:47,451 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 121 states. [2018-07-25 13:31:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:48,355 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:31:48,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:31:48,355 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 120 [2018-07-25 13:31:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:48,356 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:31:48,356 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 13:31:48,357 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:31:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 13:31:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 13:31:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 13:31:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 13:31:48,365 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 13:31:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:48,365 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 13:31:48,365 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:31:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 13:31:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 13:31:48,366 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:48,366 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1] [2018-07-25 13:31:48,366 INFO L415 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:48,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1895593320, now seen corresponding path program 119 times [2018-07-25 13:31:48,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:49,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:49,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:31:49,160 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:31:49,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:31:49,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:31:49,161 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-07-25 13:31:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:50,084 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 13:31:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:31:50,085 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-07-25 13:31:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:50,085 INFO L225 Difference]: With dead ends: 124 [2018-07-25 13:31:50,085 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:31:50,086 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:31:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:31:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:31:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:31:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:31:50,094 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 13:31:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:50,094 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:31:50,094 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:31:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:31:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:31:50,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:50,095 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1] [2018-07-25 13:31:50,095 INFO L415 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1366149459, now seen corresponding path program 120 times [2018-07-25 13:31:50,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:50,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:50,882 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:31:50,882 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:31:50,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:31:50,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:31:50,883 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 123 states. [2018-07-25 13:31:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:51,808 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:31:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:31:51,808 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 122 [2018-07-25 13:31:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:51,809 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:31:51,809 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 13:31:51,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:31:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 13:31:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 13:31:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 13:31:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 13:31:51,818 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 13:31:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:51,818 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 13:31:51,818 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:31:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 13:31:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 13:31:51,819 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:51,819 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1] [2018-07-25 13:31:51,819 INFO L415 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:51,820 INFO L82 PathProgramCache]: Analyzing trace with hash -599039496, now seen corresponding path program 121 times [2018-07-25 13:31:51,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:52,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:52,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:31:52,489 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:31:52,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:31:52,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:31:52,490 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-07-25 13:31:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:53,420 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 13:31:53,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:31:53,420 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-07-25 13:31:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:53,421 INFO L225 Difference]: With dead ends: 126 [2018-07-25 13:31:53,421 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:31:53,422 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:31:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:31:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:31:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:31:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:31:53,429 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 13:31:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:53,429 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:31:53,429 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:31:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:31:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:31:53,430 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:53,430 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1] [2018-07-25 13:31:53,430 INFO L415 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1390354957, now seen corresponding path program 122 times [2018-07-25 13:31:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:54,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:54,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:31:54,163 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:31:54,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:31:54,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:31:54,164 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 125 states. [2018-07-25 13:31:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:55,119 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:31:55,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:31:55,119 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 124 [2018-07-25 13:31:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:55,120 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:31:55,120 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 13:31:55,120 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:31:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 13:31:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 13:31:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 13:31:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 13:31:55,128 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 13:31:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:55,129 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 13:31:55,129 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:31:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 13:31:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 13:31:55,129 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:55,130 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1] [2018-07-25 13:31:55,130 INFO L415 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash -151330472, now seen corresponding path program 123 times [2018-07-25 13:31:55,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:55,994 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:55,994 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:31:55,994 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:31:55,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:31:55,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:31:55,995 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-07-25 13:31:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:56,972 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 13:31:56,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:31:56,972 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-07-25 13:31:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:56,973 INFO L225 Difference]: With dead ends: 128 [2018-07-25 13:31:56,973 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:31:56,974 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:31:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:31:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:31:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:31:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:31:56,979 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 13:31:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:56,979 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:31:56,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:31:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:31:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:31:56,979 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:56,979 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1] [2018-07-25 13:31:56,980 INFO L415 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash -396277101, now seen corresponding path program 124 times [2018-07-25 13:31:56,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:57,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:57,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:31:57,758 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:31:57,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:31:57,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:31:57,759 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 127 states. [2018-07-25 13:31:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:58,763 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:31:58,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:31:58,764 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 126 [2018-07-25 13:31:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:58,764 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:31:58,764 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 13:31:58,765 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:31:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 13:31:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 13:31:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 13:31:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 13:31:58,773 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 13:31:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:58,773 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 13:31:58,773 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:31:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 13:31:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 13:31:58,774 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:58,774 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1] [2018-07-25 13:31:58,774 INFO L415 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash 600311992, now seen corresponding path program 125 times [2018-07-25 13:31:58,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:59,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:59,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:31:59,517 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:31:59,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:31:59,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:31:59,519 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-07-25 13:32:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:00,525 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 13:32:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:32:00,526 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-07-25 13:32:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:00,526 INFO L225 Difference]: With dead ends: 130 [2018-07-25 13:32:00,526 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:32:00,527 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:32:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:32:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:32:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:32:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:32:00,534 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 13:32:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:00,535 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:32:00,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:32:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:32:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:32:00,535 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:00,535 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1] [2018-07-25 13:32:00,535 INFO L415 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1429802803, now seen corresponding path program 126 times [2018-07-25 13:32:00,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:01,331 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:01,331 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:32:01,331 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:32:01,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:32:01,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:32:01,333 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 129 states. [2018-07-25 13:32:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:02,416 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:32:02,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:32:02,416 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 128 [2018-07-25 13:32:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:02,417 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:32:02,417 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 13:32:02,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:32:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 13:32:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 13:32:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 13:32:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 13:32:02,422 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 13:32:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:02,422 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 13:32:02,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:32:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 13:32:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 13:32:02,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:02,423 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1] [2018-07-25 13:32:02,424 INFO L415 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1374214168, now seen corresponding path program 127 times [2018-07-25 13:32:02,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:03,427 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:03,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:32:03,428 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:32:03,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:32:03,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:32:03,430 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-07-25 13:32:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:04,466 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 13:32:04,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:32:04,467 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-07-25 13:32:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:04,467 INFO L225 Difference]: With dead ends: 132 [2018-07-25 13:32:04,467 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:32:04,469 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:32:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:32:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:32:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:32:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:32:04,475 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 13:32:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:04,476 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:32:04,476 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:32:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:32:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:32:04,476 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:04,476 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1] [2018-07-25 13:32:04,477 INFO L415 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash -349033517, now seen corresponding path program 128 times [2018-07-25 13:32:04,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:05,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:05,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:32:05,256 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:32:05,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:32:05,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:32:05,258 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 131 states. [2018-07-25 13:32:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:06,313 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:32:06,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:32:06,313 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 130 [2018-07-25 13:32:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:06,314 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:32:06,314 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 13:32:06,315 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:32:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 13:32:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 13:32:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 13:32:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 13:32:06,323 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 13:32:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:06,324 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 13:32:06,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:32:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 13:32:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 13:32:06,324 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:06,324 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1] [2018-07-25 13:32:06,325 INFO L415 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2064863096, now seen corresponding path program 129 times [2018-07-25 13:32:06,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:07,221 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:07,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:32:07,221 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:32:07,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:32:07,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:32:07,223 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-07-25 13:32:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:08,281 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 13:32:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:32:08,281 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-07-25 13:32:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:08,281 INFO L225 Difference]: With dead ends: 134 [2018-07-25 13:32:08,281 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:32:08,283 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:32:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:32:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:32:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:32:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:32:08,290 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 13:32:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:08,290 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:32:08,290 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:32:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:32:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:32:08,291 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:08,291 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1] [2018-07-25 13:32:08,291 INFO L415 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash -413753229, now seen corresponding path program 130 times [2018-07-25 13:32:08,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:09,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:09,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:32:09,129 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:32:09,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:32:09,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:32:09,130 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 133 states. [2018-07-25 13:32:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:10,228 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:32:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:32:10,228 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 132 [2018-07-25 13:32:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:10,229 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:32:10,229 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 13:32:10,230 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:32:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 13:32:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 13:32:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 13:32:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 13:32:10,236 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 13:32:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:10,236 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 13:32:10,236 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:32:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 13:32:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 13:32:10,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:10,237 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1] [2018-07-25 13:32:10,237 INFO L415 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 58552024, now seen corresponding path program 131 times [2018-07-25 13:32:10,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:11,125 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:11,125 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:32:11,126 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:32:11,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:32:11,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:32:11,127 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-07-25 13:32:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:12,235 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 13:32:12,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:32:12,235 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-07-25 13:32:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:12,235 INFO L225 Difference]: With dead ends: 136 [2018-07-25 13:32:12,235 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:32:12,237 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:32:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:32:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:32:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:32:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:32:12,243 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 13:32:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:12,243 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:32:12,243 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:32:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:32:12,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:32:12,244 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:12,244 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1] [2018-07-25 13:32:12,244 INFO L415 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1815112979, now seen corresponding path program 132 times [2018-07-25 13:32:12,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:13,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:13,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:32:13,092 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:32:13,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:32:13,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:32:13,093 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 135 states. [2018-07-25 13:32:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:14,246 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:32:14,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:32:14,247 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 134 [2018-07-25 13:32:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:14,247 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:32:14,247 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 13:32:14,249 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:32:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 13:32:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 13:32:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 13:32:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 13:32:14,255 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 13:32:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:14,256 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 13:32:14,256 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:32:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 13:32:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 13:32:14,257 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:14,257 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1] [2018-07-25 13:32:14,257 INFO L415 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash 433927736, now seen corresponding path program 133 times [2018-07-25 13:32:14,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:15,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:15,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:32:15,152 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:32:15,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:32:15,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:32:15,154 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-07-25 13:32:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:16,299 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 13:32:16,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:32:16,300 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-07-25 13:32:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:16,300 INFO L225 Difference]: With dead ends: 138 [2018-07-25 13:32:16,300 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:32:16,302 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:32:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:32:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:32:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:32:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:32:16,310 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 13:32:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:16,310 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:32:16,310 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:32:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:32:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:32:16,311 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:16,311 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1] [2018-07-25 13:32:16,311 INFO L415 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash 566858163, now seen corresponding path program 134 times [2018-07-25 13:32:16,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:17,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:17,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:32:17,190 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:32:17,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:32:17,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:32:17,192 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 137 states. [2018-07-25 13:32:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:18,387 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:32:18,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:32:18,388 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 136 [2018-07-25 13:32:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:18,388 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:32:18,388 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 13:32:18,389 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:32:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 13:32:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 13:32:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 13:32:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 13:32:18,394 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 13:32:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:18,394 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 13:32:18,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:32:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 13:32:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 13:32:18,395 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:18,395 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1] [2018-07-25 13:32:18,395 INFO L415 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:18,395 INFO L82 PathProgramCache]: Analyzing trace with hash 392734104, now seen corresponding path program 135 times [2018-07-25 13:32:18,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:19,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:19,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:32:19,327 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:32:19,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:32:19,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:32:19,328 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-07-25 13:32:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:20,491 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 13:32:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:32:20,491 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-07-25 13:32:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:20,491 INFO L225 Difference]: With dead ends: 140 [2018-07-25 13:32:20,491 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:32:20,493 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:32:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:32:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:32:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:32:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:32:20,498 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 13:32:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:20,498 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:32:20,498 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:32:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:32:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:32:20,499 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:20,499 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1] [2018-07-25 13:32:20,499 INFO L415 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash -710144429, now seen corresponding path program 136 times [2018-07-25 13:32:20,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:21,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:21,397 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:32:21,397 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:32:21,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:32:21,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:32:21,398 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 139 states. [2018-07-25 13:32:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:22,644 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:32:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:32:22,644 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 138 [2018-07-25 13:32:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:22,644 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:32:22,644 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 13:32:22,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:32:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 13:32:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 13:32:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 13:32:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 13:32:22,650 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 13:32:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:22,650 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 13:32:22,651 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:32:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 13:32:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 13:32:22,651 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:22,651 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1] [2018-07-25 13:32:22,651 INFO L415 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash -539640584, now seen corresponding path program 137 times [2018-07-25 13:32:22,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:23,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:23,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:32:23,549 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:32:23,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:32:23,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:32:23,552 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-07-25 13:32:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:24,757 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 13:32:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:32:24,757 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-07-25 13:32:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:24,757 INFO L225 Difference]: With dead ends: 142 [2018-07-25 13:32:24,758 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:32:24,759 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:32:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:32:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:32:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:32:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:32:24,766 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 13:32:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:24,766 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:32:24,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:32:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:32:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:32:24,767 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:24,767 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1] [2018-07-25 13:32:24,767 INFO L415 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash 451011315, now seen corresponding path program 138 times [2018-07-25 13:32:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:25,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:25,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:32:25,725 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:32:25,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:32:25,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:32:25,726 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 141 states. [2018-07-25 13:32:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:26,938 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:32:26,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:32:26,938 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-07-25 13:32:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:26,938 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:32:26,938 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 13:32:26,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:32:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 13:32:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 13:32:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 13:32:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 13:32:26,945 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 13:32:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:26,945 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 13:32:26,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:32:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 13:32:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 13:32:26,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:26,945 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1] [2018-07-25 13:32:26,946 INFO L415 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:26,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1096449112, now seen corresponding path program 139 times [2018-07-25 13:32:26,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:27,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:27,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:32:27,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:32:27,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:32:27,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:32:27,899 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-07-25 13:32:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:29,150 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 13:32:29,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:32:29,151 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-07-25 13:32:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:29,151 INFO L225 Difference]: With dead ends: 144 [2018-07-25 13:32:29,151 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:32:29,152 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:32:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:32:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:32:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:32:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:32:29,157 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 13:32:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:29,157 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:32:29,158 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:32:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:32:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:32:29,158 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:29,158 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1] [2018-07-25 13:32:29,159 INFO L415 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:29,159 INFO L82 PathProgramCache]: Analyzing trace with hash -369815661, now seen corresponding path program 140 times [2018-07-25 13:32:29,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:30,160 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:30,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:32:30,161 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:32:30,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:32:30,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:32:30,162 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 143 states. [2018-07-25 13:32:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:31,411 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:32:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:32:31,412 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 142 [2018-07-25 13:32:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:31,412 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:32:31,412 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 13:32:31,413 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:32:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 13:32:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 13:32:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 13:32:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 13:32:31,419 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 13:32:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:31,419 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 13:32:31,419 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:32:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 13:32:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 13:32:31,419 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:31,420 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1] [2018-07-25 13:32:31,420 INFO L415 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1420616632, now seen corresponding path program 141 times [2018-07-25 13:32:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:32,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:32,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:32:32,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:32:32,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:32:32,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:32:32,369 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-07-25 13:32:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:33,693 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 13:32:33,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:32:33,693 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-07-25 13:32:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:33,693 INFO L225 Difference]: With dead ends: 146 [2018-07-25 13:32:33,694 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:32:33,694 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:32:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:32:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:32:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:32:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:32:33,699 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 13:32:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:33,700 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:32:33,700 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:32:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:32:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:32:33,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:33,700 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1] [2018-07-25 13:32:33,701 INFO L415 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1089442867, now seen corresponding path program 142 times [2018-07-25 13:32:33,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:34,708 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:34,708 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:32:34,708 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:32:34,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:32:34,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:32:34,709 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 145 states. [2018-07-25 13:32:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:36,019 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:32:36,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:32:36,020 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 144 [2018-07-25 13:32:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:36,020 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:32:36,020 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 13:32:36,021 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:32:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 13:32:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 13:32:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 13:32:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 13:32:36,026 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 13:32:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:36,027 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 13:32:36,027 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:32:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 13:32:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 13:32:36,027 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:36,028 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1] [2018-07-25 13:32:36,028 INFO L415 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash -587009256, now seen corresponding path program 143 times [2018-07-25 13:32:36,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:37,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:37,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:32:37,026 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:32:37,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:32:37,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:32:37,027 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-07-25 13:32:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:38,344 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 13:32:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:32:38,344 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-07-25 13:32:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:38,345 INFO L225 Difference]: With dead ends: 148 [2018-07-25 13:32:38,345 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:32:38,345 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:32:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:32:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:32:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:32:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:32:38,351 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 13:32:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:38,351 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:32:38,351 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:32:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:32:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:32:38,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:38,351 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1] [2018-07-25 13:32:38,351 INFO L415 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1017417517, now seen corresponding path program 144 times [2018-07-25 13:32:38,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:39,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:39,347 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:32:39,348 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:32:39,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:32:39,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:32:39,349 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 147 states. [2018-07-25 13:32:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:40,714 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:32:40,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:32:40,714 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 146 [2018-07-25 13:32:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:40,714 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:32:40,714 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 13:32:40,716 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:32:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 13:32:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 13:32:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 13:32:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 13:32:40,721 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 13:32:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:40,721 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 13:32:40,721 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:32:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 13:32:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 13:32:40,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:40,722 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1] [2018-07-25 13:32:40,722 INFO L415 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:40,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1475171720, now seen corresponding path program 145 times [2018-07-25 13:32:40,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:41,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:41,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:32:41,785 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:32:41,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:32:41,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:32:41,786 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-07-25 13:32:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:43,126 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 13:32:43,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:32:43,126 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-07-25 13:32:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:43,126 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:32:43,127 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:32:43,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:32:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:32:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:32:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:32:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:32:43,134 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 13:32:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:43,134 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:32:43,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:32:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:32:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:32:43,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:43,134 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1] [2018-07-25 13:32:43,135 INFO L415 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1514317171, now seen corresponding path program 146 times [2018-07-25 13:32:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:44,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:44,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:32:44,171 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:32:44,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:32:44,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:32:44,173 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 149 states. [2018-07-25 13:32:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:45,563 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:32:45,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:32:45,563 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 148 [2018-07-25 13:32:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:45,563 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:32:45,563 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 13:32:45,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:32:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 13:32:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 13:32:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 13:32:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 13:32:45,570 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 13:32:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:45,570 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 13:32:45,570 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:32:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 13:32:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 13:32:45,571 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:45,571 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1] [2018-07-25 13:32:45,571 INFO L415 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:45,571 INFO L82 PathProgramCache]: Analyzing trace with hash -300807720, now seen corresponding path program 147 times [2018-07-25 13:32:45,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:46,614 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:46,614 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:32:46,614 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:32:46,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:32:46,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:32:46,615 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-07-25 13:32:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:47,999 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 13:32:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:32:47,999 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-07-25 13:32:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:48,000 INFO L225 Difference]: With dead ends: 152 [2018-07-25 13:32:48,000 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:32:48,002 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:32:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:32:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:32:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:32:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:32:48,010 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 13:32:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:48,011 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:32:48,011 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:32:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:32:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:32:48,011 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:48,012 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1] [2018-07-25 13:32:48,012 INFO L415 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash -735104493, now seen corresponding path program 148 times [2018-07-25 13:32:48,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:49,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:49,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:32:49,106 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:32:49,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:32:49,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:32:49,108 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 151 states. [2018-07-25 13:32:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:50,502 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:32:50,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:32:50,502 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 150 [2018-07-25 13:32:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:50,502 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:32:50,503 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 13:32:50,504 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:32:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 13:32:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 13:32:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 13:32:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 13:32:50,509 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 13:32:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:50,509 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 13:32:50,509 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:32:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 13:32:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 13:32:50,510 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:50,510 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1] [2018-07-25 13:32:50,510 INFO L415 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1313402568, now seen corresponding path program 149 times [2018-07-25 13:32:50,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:51,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:51,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:32:51,611 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:32:51,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:32:51,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:32:51,613 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-07-25 13:32:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:53,080 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 13:32:53,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:32:53,081 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-07-25 13:32:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:53,081 INFO L225 Difference]: With dead ends: 154 [2018-07-25 13:32:53,081 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:32:53,082 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:32:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:32:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:32:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:32:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:32:53,087 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 13:32:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:53,087 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:32:53,087 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:32:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:32:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:32:53,088 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:53,088 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1] [2018-07-25 13:32:53,088 INFO L415 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:53,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2060773709, now seen corresponding path program 150 times [2018-07-25 13:32:53,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:54,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:54,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:32:54,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:32:54,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:32:54,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:32:54,147 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 153 states. [2018-07-25 13:32:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:55,615 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:32:55,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:32:55,615 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 152 [2018-07-25 13:32:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:55,615 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:32:55,615 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 13:32:55,617 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:32:55,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 13:32:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 13:32:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 13:32:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 13:32:55,622 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 13:32:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:55,622 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 13:32:55,622 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 13:32:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 13:32:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 13:32:55,623 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:55,623 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1] [2018-07-25 13:32:55,623 INFO L415 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash 540524696, now seen corresponding path program 151 times [2018-07-25 13:32:55,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:56,762 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:56,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 13:32:56,762 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:32:56,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:32:56,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:32:56,763 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-07-25 13:32:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:58,217 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 13:32:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:32:58,218 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-07-25 13:32:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:58,218 INFO L225 Difference]: With dead ends: 156 [2018-07-25 13:32:58,218 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:32:58,219 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:32:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:32:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:32:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:32:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:32:58,225 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 13:32:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:58,225 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:32:58,225 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 13:32:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:32:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:32:58,226 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:58,226 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1] [2018-07-25 13:32:58,226 INFO L415 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:58,226 INFO L82 PathProgramCache]: Analyzing trace with hash -423603373, now seen corresponding path program 152 times [2018-07-25 13:32:58,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:59,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:59,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:32:59,335 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 13:32:59,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 13:32:59,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:32:59,337 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 155 states. [2018-07-25 13:33:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:00,848 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:33:00,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:33:00,848 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 154 [2018-07-25 13:33:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:00,849 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:33:00,849 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 13:33:00,850 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:33:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 13:33:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 13:33:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 13:33:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 13:33:00,856 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 13:33:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:00,856 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 13:33:00,856 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 13:33:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 13:33:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 13:33:00,856 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:00,856 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1] [2018-07-25 13:33:00,857 INFO L415 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash -246802440, now seen corresponding path program 153 times [2018-07-25 13:33:00,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:01,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:01,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 13:33:01,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 13:33:01,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 13:33:01,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:33:01,970 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-07-25 13:33:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:03,502 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 13:33:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 13:33:03,503 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-07-25 13:33:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:03,503 INFO L225 Difference]: With dead ends: 158 [2018-07-25 13:33:03,503 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:33:03,505 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:33:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:33:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:33:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:33:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:33:03,513 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 13:33:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:03,514 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:33:03,514 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 13:33:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:33:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:33:03,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:03,515 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1] [2018-07-25 13:33:03,515 INFO L415 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:03,515 INFO L82 PathProgramCache]: Analyzing trace with hash 939059187, now seen corresponding path program 154 times [2018-07-25 13:33:03,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:04,741 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:04,741 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 13:33:04,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 13:33:04,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 13:33:04,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:33:04,743 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 157 states. [2018-07-25 13:33:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:06,262 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:33:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:33:06,262 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 156 [2018-07-25 13:33:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:06,262 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:33:06,263 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 13:33:06,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:33:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 13:33:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 13:33:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 13:33:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 13:33:06,269 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 13:33:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:06,269 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 13:33:06,270 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 13:33:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 13:33:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 13:33:06,270 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:06,270 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1] [2018-07-25 13:33:06,271 INFO L415 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash -953936040, now seen corresponding path program 155 times [2018-07-25 13:33:06,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:07,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:07,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 13:33:07,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 13:33:07,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 13:33:07,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:33:07,464 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-07-25 13:33:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:09,095 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 13:33:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:33:09,096 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-07-25 13:33:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:09,096 INFO L225 Difference]: With dead ends: 160 [2018-07-25 13:33:09,096 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:33:09,097 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:33:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:33:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:33:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:33:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:33:09,103 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 13:33:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:09,103 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:33:09,103 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 13:33:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:33:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:33:09,104 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:09,104 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1] [2018-07-25 13:33:09,104 INFO L415 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash 492754067, now seen corresponding path program 156 times [2018-07-25 13:33:09,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:10,292 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:10,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 13:33:10,293 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 13:33:10,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 13:33:10,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:33:10,294 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 159 states. [2018-07-25 13:33:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,902 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:33:11,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 13:33:11,903 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 158 [2018-07-25 13:33:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,903 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:33:11,903 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 13:33:11,904 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:33:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 13:33:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 13:33:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 13:33:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 13:33:11,909 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 13:33:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,910 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 13:33:11,910 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 13:33:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 13:33:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 13:33:11,910 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,910 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1] [2018-07-25 13:33:11,910 INFO L415 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1904492872, now seen corresponding path program 157 times [2018-07-25 13:33:11,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:13,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:13,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 13:33:13,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 13:33:13,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 13:33:13,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:33:13,125 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-07-25 13:33:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:14,710 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 13:33:14,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:33:14,710 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-07-25 13:33:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:14,710 INFO L225 Difference]: With dead ends: 162 [2018-07-25 13:33:14,711 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:33:14,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:33:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:33:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:33:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:33:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:33:14,721 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 13:33:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:14,721 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:33:14,721 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 13:33:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:33:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:33:14,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:14,722 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1] [2018-07-25 13:33:14,722 INFO L415 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1090263347, now seen corresponding path program 158 times [2018-07-25 13:33:14,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:15,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:15,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 13:33:15,999 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 13:33:15,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 13:33:16,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:33:16,000 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 161 states. [2018-07-25 13:33:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:17,562 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:33:17,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 13:33:17,563 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 160 [2018-07-25 13:33:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:17,563 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:33:17,563 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 13:33:17,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:33:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 13:33:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 13:33:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 13:33:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 13:33:17,570 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 13:33:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:17,570 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 13:33:17,570 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 13:33:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 13:33:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 13:33:17,571 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:17,571 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1] [2018-07-25 13:33:17,571 INFO L415 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:17,571 INFO L82 PathProgramCache]: Analyzing trace with hash -561574376, now seen corresponding path program 159 times [2018-07-25 13:33:17,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:18,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:18,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 13:33:18,789 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 13:33:18,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 13:33:18,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:33:18,791 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-07-25 13:33:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:20,425 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 13:33:20,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:33:20,425 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-07-25 13:33:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:20,425 INFO L225 Difference]: With dead ends: 164 [2018-07-25 13:33:20,425 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:33:20,426 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:33:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:33:20,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:33:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:33:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:33:20,432 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 13:33:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:20,432 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:33:20,432 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 13:33:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:33:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:33:20,432 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:20,432 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1] [2018-07-25 13:33:20,433 INFO L415 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:20,433 INFO L82 PathProgramCache]: Analyzing trace with hash -228936237, now seen corresponding path program 160 times [2018-07-25 13:33:20,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:21,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:21,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 13:33:21,654 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 13:33:21,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 13:33:21,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:33:21,656 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 163 states. [2018-07-25 13:33:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:23,352 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:33:23,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 13:33:23,352 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 162 [2018-07-25 13:33:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:23,352 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:33:23,352 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 13:33:23,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:33:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 13:33:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 13:33:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 13:33:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 13:33:23,362 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 13:33:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:23,363 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 13:33:23,363 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 13:33:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 13:33:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 13:33:23,363 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:23,364 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1] [2018-07-25 13:33:23,364 INFO L415 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1492911480, now seen corresponding path program 161 times [2018-07-25 13:33:23,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:24,655 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:24,655 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 13:33:24,655 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 13:33:24,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 13:33:24,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:33:24,657 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-07-25 13:33:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:26,351 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 13:33:26,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:33:26,351 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-07-25 13:33:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:26,351 INFO L225 Difference]: With dead ends: 166 [2018-07-25 13:33:26,351 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:33:26,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:33:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:33:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:33:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:33:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:33:26,359 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 13:33:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:26,359 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:33:26,359 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 13:33:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:33:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:33:26,359 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:26,360 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1] [2018-07-25 13:33:26,360 INFO L415 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash -964384141, now seen corresponding path program 162 times [2018-07-25 13:33:26,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:27,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:27,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 13:33:27,829 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 13:33:27,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 13:33:27,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:33:27,832 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 165 states. [2018-07-25 13:33:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:29,496 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:33:29,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:33:29,496 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 164 [2018-07-25 13:33:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:29,497 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:33:29,497 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 13:33:29,500 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:33:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 13:33:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 13:33:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 13:33:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 13:33:29,511 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 13:33:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:29,511 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 13:33:29,511 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 13:33:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 13:33:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 13:33:29,512 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:29,512 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1] [2018-07-25 13:33:29,512 INFO L415 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:29,512 INFO L82 PathProgramCache]: Analyzing trace with hash 168862936, now seen corresponding path program 163 times [2018-07-25 13:33:29,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:30,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:30,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 13:33:30,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 13:33:30,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 13:33:30,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:33:30,955 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-07-25 13:33:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:32,625 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 13:33:32,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 13:33:32,625 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-07-25 13:33:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:32,626 INFO L225 Difference]: With dead ends: 168 [2018-07-25 13:33:32,626 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:33:32,626 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:33:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:33:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:33:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:33:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:33:32,632 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 13:33:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:32,632 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:33:32,632 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 13:33:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:33:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:33:32,633 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:32,633 INFO L354 BasicCegarLoop]: trace histogram [164, 1, 1] [2018-07-25 13:33:32,633 INFO L415 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash 939783955, now seen corresponding path program 164 times [2018-07-25 13:33:32,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:33,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:33,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 13:33:33,960 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 13:33:33,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 13:33:33,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:33:33,962 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 167 states. [2018-07-25 13:33:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:35,679 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:33:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:33:35,679 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 166 [2018-07-25 13:33:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:35,679 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:33:35,679 INFO L226 Difference]: Without dead ends: 168 [2018-07-25 13:33:35,680 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:33:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-25 13:33:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-25 13:33:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 13:33:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 13:33:35,686 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-07-25 13:33:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:35,686 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 13:33:35,686 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 13:33:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 13:33:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 13:33:35,687 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:35,687 INFO L354 BasicCegarLoop]: trace histogram [165, 1, 1] [2018-07-25 13:33:35,687 INFO L415 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -931468232, now seen corresponding path program 165 times [2018-07-25 13:33:35,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:37,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:37,014 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 13:33:37,014 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 13:33:37,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 13:33:37,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:33:37,016 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-07-25 13:33:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:38,811 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 13:33:38,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 13:33:38,811 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-07-25 13:33:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:38,811 INFO L225 Difference]: With dead ends: 170 [2018-07-25 13:33:38,811 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:33:38,812 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:33:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:33:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:33:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:33:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:33:38,818 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-07-25 13:33:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:38,818 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:33:38,819 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 13:33:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:33:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:33:38,819 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:38,819 INFO L354 BasicCegarLoop]: trace histogram [166, 1, 1] [2018-07-25 13:33:38,819 INFO L415 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:38,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1189256115, now seen corresponding path program 166 times [2018-07-25 13:33:38,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:40,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:40,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 13:33:40,106 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 13:33:40,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 13:33:40,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:33:40,108 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 169 states. [2018-07-25 13:33:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:41,902 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:33:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:33:41,902 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 168 [2018-07-25 13:33:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:41,902 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:33:41,902 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 13:33:41,904 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:33:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 13:33:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-25 13:33:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 13:33:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 13:33:41,913 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-07-25 13:33:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:41,914 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 13:33:41,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 13:33:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 13:33:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 13:33:41,914 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:41,914 INFO L354 BasicCegarLoop]: trace histogram [167, 1, 1] [2018-07-25 13:33:41,915 INFO L415 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1787765864, now seen corresponding path program 167 times [2018-07-25 13:33:41,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:43,281 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:43,281 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 13:33:43,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 13:33:43,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 13:33:43,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:33:43,283 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-07-25 13:33:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:45,087 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 13:33:45,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 13:33:45,087 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-07-25 13:33:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:45,088 INFO L225 Difference]: With dead ends: 172 [2018-07-25 13:33:45,088 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:33:45,090 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:33:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:33:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:33:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:33:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:33:45,096 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-07-25 13:33:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:45,096 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:33:45,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 13:33:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:33:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:33:45,097 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:45,097 INFO L354 BasicCegarLoop]: trace histogram [168, 1, 1] [2018-07-25 13:33:45,097 INFO L415 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:45,097 INFO L82 PathProgramCache]: Analyzing trace with hash 413833299, now seen corresponding path program 168 times [2018-07-25 13:33:45,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:46,474 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:46,474 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 13:33:46,474 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 13:33:46,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 13:33:46,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:33:46,475 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 171 states. [2018-07-25 13:33:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:48,264 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:33:48,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:33:48,264 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 170 [2018-07-25 13:33:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:48,265 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:33:48,265 INFO L226 Difference]: Without dead ends: 172 [2018-07-25 13:33:48,266 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:33:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-25 13:33:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-25 13:33:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 13:33:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 13:33:48,273 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-07-25 13:33:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:48,273 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 13:33:48,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 13:33:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 13:33:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 13:33:48,273 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:48,273 INFO L354 BasicCegarLoop]: trace histogram [169, 1, 1] [2018-07-25 13:33:48,274 INFO L415 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:48,274 INFO L82 PathProgramCache]: Analyzing trace with hash -56069384, now seen corresponding path program 169 times [2018-07-25 13:33:48,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:49,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:49,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 13:33:49,676 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 13:33:49,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 13:33:49,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:33:49,677 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-07-25 13:33:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:51,507 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 13:33:51,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:33:51,507 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-07-25 13:33:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:51,508 INFO L225 Difference]: With dead ends: 174 [2018-07-25 13:33:51,508 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:33:51,509 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:33:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:33:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:33:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:33:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:33:51,515 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-07-25 13:33:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:51,515 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:33:51,515 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 13:33:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:33:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:33:51,516 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:51,516 INFO L354 BasicCegarLoop]: trace histogram [170, 1, 1] [2018-07-25 13:33:51,516 INFO L415 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1738150669, now seen corresponding path program 170 times [2018-07-25 13:33:51,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:52,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:52,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 13:33:52,927 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 13:33:52,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 13:33:52,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:33:52,930 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 173 states. [2018-07-25 13:33:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:54,823 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:33:54,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 13:33:54,823 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 172 [2018-07-25 13:33:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:54,824 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:33:54,824 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 13:33:54,825 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:33:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 13:33:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-25 13:33:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 13:33:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 13:33:54,831 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-07-25 13:33:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:54,831 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 13:33:54,831 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 13:33:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 13:33:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 13:33:54,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:54,832 INFO L354 BasicCegarLoop]: trace histogram [171, 1, 1] [2018-07-25 13:33:54,832 INFO L415 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1951904344, now seen corresponding path program 171 times [2018-07-25 13:33:54,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:56,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:56,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 13:33:56,261 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 13:33:56,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 13:33:56,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:33:56,263 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-07-25 13:33:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:58,162 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 13:33:58,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:33:58,162 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-07-25 13:33:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:58,163 INFO L225 Difference]: With dead ends: 176 [2018-07-25 13:33:58,163 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:33:58,164 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:33:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:33:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:33:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:33:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:33:58,171 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-07-25 13:33:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:58,171 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:33:58,171 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 13:33:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:33:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:33:58,172 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:58,172 INFO L354 BasicCegarLoop]: trace histogram [172, 1, 1] [2018-07-25 13:33:58,172 INFO L415 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 379492755, now seen corresponding path program 172 times [2018-07-25 13:33:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:59,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:59,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 13:33:59,609 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 13:33:59,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 13:33:59,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:33:59,611 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 175 states. [2018-07-25 13:34:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:01,629 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:34:01,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 13:34:01,630 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 174 [2018-07-25 13:34:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:01,630 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:34:01,630 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 13:34:01,632 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:34:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 13:34:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-25 13:34:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 13:34:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 13:34:01,641 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-07-25 13:34:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:01,642 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 13:34:01,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 13:34:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 13:34:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 13:34:01,643 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:01,643 INFO L354 BasicCegarLoop]: trace histogram [173, 1, 1] [2018-07-25 13:34:01,643 INFO L415 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:01,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1120626248, now seen corresponding path program 173 times [2018-07-25 13:34:01,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:03,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:03,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 13:34:03,152 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 13:34:03,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 13:34:03,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:34:03,155 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-07-25 13:34:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:05,125 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 13:34:05,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:34:05,126 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-07-25 13:34:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:05,126 INFO L225 Difference]: With dead ends: 178 [2018-07-25 13:34:05,126 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:34:05,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:34:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:34:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:34:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:34:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:34:05,135 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-07-25 13:34:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:05,135 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:34:05,135 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 13:34:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:34:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:34:05,135 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:05,135 INFO L354 BasicCegarLoop]: trace histogram [174, 1, 1] [2018-07-25 13:34:05,136 INFO L415 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:05,136 INFO L82 PathProgramCache]: Analyzing trace with hash -379675085, now seen corresponding path program 174 times [2018-07-25 13:34:05,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:06,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:06,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 13:34:06,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 13:34:06,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 13:34:06,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:34:06,740 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 177 states. [2018-07-25 13:34:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:08,902 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:34:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 13:34:08,902 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 176 [2018-07-25 13:34:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:08,903 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:34:08,903 INFO L226 Difference]: Without dead ends: 178 [2018-07-25 13:34:08,906 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:34:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-25 13:34:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-25 13:34:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 13:34:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 13:34:08,913 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-07-25 13:34:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:08,913 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 13:34:08,913 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 13:34:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 13:34:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 13:34:08,914 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:08,914 INFO L354 BasicCegarLoop]: trace histogram [175, 1, 1] [2018-07-25 13:34:08,914 INFO L415 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1114974488, now seen corresponding path program 175 times [2018-07-25 13:34:08,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:10,563 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:10,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 13:34:10,564 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 13:34:10,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 13:34:10,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:34:10,566 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-07-25 13:34:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:12,652 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 13:34:12,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 13:34:12,652 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-07-25 13:34:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:12,652 INFO L225 Difference]: With dead ends: 180 [2018-07-25 13:34:12,652 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:34:12,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:34:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:34:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:34:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:34:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:34:12,662 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-07-25 13:34:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:12,662 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:34:12,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 13:34:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:34:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:34:12,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:12,663 INFO L354 BasicCegarLoop]: trace histogram [176, 1, 1] [2018-07-25 13:34:12,663 INFO L415 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash 204470995, now seen corresponding path program 176 times [2018-07-25 13:34:12,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:14,420 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:14,420 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 13:34:14,420 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 13:34:14,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 13:34:14,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:34:14,422 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 179 states. [2018-07-25 13:34:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:16,535 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:34:16,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 13:34:16,535 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 178 [2018-07-25 13:34:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:16,536 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:34:16,536 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 13:34:16,538 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:34:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 13:34:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 13:34:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 13:34:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-25 13:34:16,545 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-07-25 13:34:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:16,545 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-25 13:34:16,545 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 13:34:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-25 13:34:16,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-25 13:34:16,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:16,546 INFO L354 BasicCegarLoop]: trace histogram [177, 1, 1] [2018-07-25 13:34:16,546 INFO L415 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2043633784, now seen corresponding path program 177 times [2018-07-25 13:34:16,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:18,258 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:18,258 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 13:34:18,258 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 13:34:18,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 13:34:18,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:34:18,260 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-07-25 13:34:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:20,381 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-25 13:34:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 13:34:20,382 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-07-25 13:34:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:20,382 INFO L225 Difference]: With dead ends: 182 [2018-07-25 13:34:20,382 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:34:20,385 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:34:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:34:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:34:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:34:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:34:20,392 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-07-25 13:34:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:20,392 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:34:20,392 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 13:34:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:34:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:34:20,393 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:20,393 INFO L354 BasicCegarLoop]: trace histogram [178, 1, 1] [2018-07-25 13:34:20,393 INFO L415 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:20,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1071861901, now seen corresponding path program 178 times [2018-07-25 13:34:20,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:22,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:22,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 13:34:22,142 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 13:34:22,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 13:34:22,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:34:22,144 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 181 states. [2018-07-25 13:34:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:24,214 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:34:24,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 13:34:24,214 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 180 [2018-07-25 13:34:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:24,215 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:34:24,215 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 13:34:24,217 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:34:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 13:34:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 13:34:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 13:34:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-25 13:34:24,225 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-07-25 13:34:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:24,225 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-25 13:34:24,225 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 13:34:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-25 13:34:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-25 13:34:24,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:24,226 INFO L354 BasicCegarLoop]: trace histogram [179, 1, 1] [2018-07-25 13:34:24,226 INFO L415 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:24,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1132019672, now seen corresponding path program 179 times [2018-07-25 13:34:24,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:25,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:25,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 13:34:25,865 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 13:34:25,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 13:34:25,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=32581, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:34:25,867 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-07-25 13:34:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:27,957 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-25 13:34:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 13:34:27,957 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-07-25 13:34:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:27,958 INFO L225 Difference]: With dead ends: 184 [2018-07-25 13:34:27,958 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:34:27,959 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=32581, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:34:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:34:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:34:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:34:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:34:27,966 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-07-25 13:34:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:27,966 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:34:27,966 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 13:34:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:34:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:34:27,967 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:27,967 INFO L354 BasicCegarLoop]: trace histogram [180, 1, 1] [2018-07-25 13:34:27,967 INFO L415 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash 732871699, now seen corresponding path program 180 times [2018-07-25 13:34:27,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:29,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:29,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 13:34:29,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 13:34:29,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 13:34:29,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=32943, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:34:29,598 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 183 states. [2018-07-25 13:34:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:31,685 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:34:31,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 13:34:31,686 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 182 [2018-07-25 13:34:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:31,686 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:34:31,686 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 13:34:31,689 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=363, Invalid=32943, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:34:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 13:34:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 13:34:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 13:34:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-25 13:34:31,695 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-07-25 13:34:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:31,696 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-25 13:34:31,696 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 13:34:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-25 13:34:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 13:34:31,696 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:31,696 INFO L354 BasicCegarLoop]: trace histogram [181, 1, 1] [2018-07-25 13:34:31,696 INFO L415 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:31,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1244186424, now seen corresponding path program 181 times [2018-07-25 13:34:31,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:33,415 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:33,415 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 13:34:33,415 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 13:34:33,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 13:34:33,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=33307, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:34:33,417 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2018-07-25 13:34:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:35,579 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-25 13:34:35,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 13:34:35,579 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 183 [2018-07-25 13:34:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:35,580 INFO L225 Difference]: With dead ends: 186 [2018-07-25 13:34:35,580 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:34:35,582 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=365, Invalid=33307, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:34:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:34:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:34:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:34:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:34:35,593 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-07-25 13:34:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:35,593 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:34:35,593 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 13:34:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:34:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:34:35,594 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:35,594 INFO L354 BasicCegarLoop]: trace histogram [182, 1, 1] [2018-07-25 13:34:35,594 INFO L415 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:35,594 INFO L82 PathProgramCache]: Analyzing trace with hash -84926285, now seen corresponding path program 182 times [2018-07-25 13:34:35,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:37,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:37,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 13:34:37,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 13:34:37,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 13:34:37,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=33673, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:34:37,293 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 185 states. [2018-07-25 13:34:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:39,491 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:34:39,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 13:34:39,492 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 184 [2018-07-25 13:34:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:39,492 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:34:39,492 INFO L226 Difference]: Without dead ends: 186 [2018-07-25 13:34:39,494 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=367, Invalid=33673, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:34:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-25 13:34:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-07-25 13:34:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-25 13:34:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-25 13:34:39,501 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-07-25 13:34:39,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:39,501 INFO L472 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-25 13:34:39,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-25 13:34:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-25 13:34:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-25 13:34:39,502 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:39,502 INFO L354 BasicCegarLoop]: trace histogram [183, 1, 1] [2018-07-25 13:34:39,502 INFO L415 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:39,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1662252696, now seen corresponding path program 183 times [2018-07-25 13:34:39,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:41,412 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:41,412 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-25 13:34:41,412 INFO L451 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-25 13:34:41,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-25 13:34:41,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=34041, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:34:41,414 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 186 states. [2018-07-25 13:34:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:43,766 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-07-25 13:34:43,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 13:34:43,767 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 185 [2018-07-25 13:34:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:43,767 INFO L225 Difference]: With dead ends: 188 [2018-07-25 13:34:43,767 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:34:43,769 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=34041, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:34:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:34:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:34:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:34:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:34:43,776 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-07-25 13:34:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:43,777 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:34:43,777 INFO L473 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-25 13:34:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:34:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:34:43,777 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:43,777 INFO L354 BasicCegarLoop]: trace histogram [184, 1, 1] [2018-07-25 13:34:43,777 INFO L415 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:43,778 INFO L82 PathProgramCache]: Analyzing trace with hash -9773741, now seen corresponding path program 184 times [2018-07-25 13:34:43,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:45,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:45,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-25 13:34:45,733 INFO L451 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-25 13:34:45,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-25 13:34:45,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=34411, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:34:45,735 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 187 states. [2018-07-25 13:34:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:48,097 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:34:48,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-25 13:34:48,098 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 186 [2018-07-25 13:34:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:48,098 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:34:48,098 INFO L226 Difference]: Without dead ends: 188 [2018-07-25 13:34:48,100 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=371, Invalid=34411, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:34:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-25 13:34:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-25 13:34:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-25 13:34:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-25 13:34:48,108 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-07-25 13:34:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:48,108 INFO L472 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-25 13:34:48,108 INFO L473 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-25 13:34:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-25 13:34:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-25 13:34:48,108 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:48,108 INFO L354 BasicCegarLoop]: trace histogram [185, 1, 1] [2018-07-25 13:34:48,109 INFO L415 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:48,109 INFO L82 PathProgramCache]: Analyzing trace with hash -302985736, now seen corresponding path program 185 times [2018-07-25 13:34:48,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:50,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:50,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-25 13:34:50,096 INFO L451 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-25 13:34:50,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-25 13:34:50,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=34783, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:34:50,098 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 188 states. [2018-07-25 13:34:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:52,502 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-25 13:34:52,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-25 13:34:52,502 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 187 [2018-07-25 13:34:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:52,503 INFO L225 Difference]: With dead ends: 190 [2018-07-25 13:34:52,503 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:34:52,505 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=373, Invalid=34783, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:34:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:34:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:34:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:34:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:34:52,512 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-07-25 13:34:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:52,513 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:34:52,513 INFO L473 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-25 13:34:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:34:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:34:52,513 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:52,513 INFO L354 BasicCegarLoop]: trace histogram [186, 1, 1] [2018-07-25 13:34:52,513 INFO L415 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:52,514 INFO L82 PathProgramCache]: Analyzing trace with hash -802622989, now seen corresponding path program 186 times [2018-07-25 13:34:52,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:54,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:54,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-25 13:34:54,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-25 13:34:54,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-25 13:34:54,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=35157, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:34:54,326 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 189 states. [2018-07-25 13:34:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:56,552 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:34:56,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-25 13:34:56,552 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 188 [2018-07-25 13:34:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:56,553 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:34:56,553 INFO L226 Difference]: Without dead ends: 190 [2018-07-25 13:34:56,554 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=375, Invalid=35157, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:34:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-25 13:34:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-07-25 13:34:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-25 13:34:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-07-25 13:34:56,561 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-07-25 13:34:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:56,561 INFO L472 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-07-25 13:34:56,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-25 13:34:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-07-25 13:34:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-25 13:34:56,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:56,562 INFO L354 BasicCegarLoop]: trace histogram [187, 1, 1] [2018-07-25 13:34:56,562 INFO L415 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:56,562 INFO L82 PathProgramCache]: Analyzing trace with hash 888491352, now seen corresponding path program 187 times [2018-07-25 13:34:56,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-25 13:34:57,477 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:34:57,483 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:34:57,483 INFO L202 PluginConnector]: Adding new model HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:34:57 BoogieIcfgContainer [2018-07-25 13:34:57,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:34:57,484 INFO L168 Benchmark]: Toolchain (without parser) took 251606.01 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 492.4 MB. Max. memory is 7.1 GB. [2018-07-25 13:34:57,486 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:34:57,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:34:57,487 INFO L168 Benchmark]: Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:34:57,494 INFO L168 Benchmark]: RCFGBuilder took 274.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:34:57,494 INFO L168 Benchmark]: TraceAbstraction took 251261.58 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 481.8 MB. Max. memory is 7.1 GB. [2018-07-25 13:34:57,498 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 274.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251261.58 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 481.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 190 with TraceHistMax 187, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 98 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 251.1s OverallTime, 188 OverallIterations, 187 TraceHistogramMax, 126.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 374 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 1892696 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 85.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17578 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=187, 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.9s AutomataMinimizationTime, 187 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 113.9s InterpolantComputationTime, 17765 NumberOfCodeBlocks, 17765 NumberOfCodeBlocksAsserted, 187 NumberOfCheckSat, 17578 ConstructedInterpolants, 0 QuantifiedInterpolants, 14052204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 187 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1089836 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEqualityWithBranches.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-34-57-519.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEqualityWithBranches.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-34-57-519.csv Completed graceful shutdown