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/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:30:01,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:30:01,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:30:01,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:30:01,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:30:01,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:30:01,244 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:30:01,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:30:01,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:30:01,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:30:01,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:30:01,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:30:01,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:30:01,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:30:01,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:30:01,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:30:01,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:30:01,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:30:01,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:30:01,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:30:01,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:30:01,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:30:01,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:30:01,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:30:01,266 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:30:01,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:30:01,268 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:30:01,269 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:30:01,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:30:01,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:30:01,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:30:01,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:30:01,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:30:01,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:30:01,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:30:01,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:30:01,274 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:01,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:30:01,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:30:01,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:30:01,285 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:30:01,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:30:01,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:30:01,285 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:30:01,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:30:01,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:30:01,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:30:01,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:30:01,349 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:30:01,350 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:30:01,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl [2018-07-25 13:30:01,351 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl' [2018-07-25 13:30:01,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:30:01,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:30:01,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:30:01,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:30:01,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:30:01,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,444 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:30:01,444 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:30:01,444 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:30:01,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:30:01,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:30:01,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:30:01,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:30:01,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:30:01,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:30:01,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:30:01,469 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:30:01,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/1) ... [2018-07-25 13:30:01,559 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 13:30:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 13:30:01,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 13:30:01,693 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:30:01,694 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:30:01 BoogieIcfgContainer [2018-07-25 13:30:01,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:30:01,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:30:01,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:30:01,700 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:30:01,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:01" (1/2) ... [2018-07-25 13:30:01,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b86fd8a and model type DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:30:01, skipping insertion in model container [2018-07-25 13:30:01,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:30:01" (2/2) ... [2018-07-25 13:30:01,704 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl [2018-07-25 13:30:01,714 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:30:01,723 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:30:01,776 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:30:01,777 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:30:01,777 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:30:01,777 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:30:01,778 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:30:01,778 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:30:01,778 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:30:01,778 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:30:01,779 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:30:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-07-25 13:30:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-07-25 13:30:01,806 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:01,807 INFO L354 BasicCegarLoop]: trace histogram [1, 1] [2018-07-25 13:30:01,808 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-07-25 13:30:01,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:01,979 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:01,982 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:30:01,982 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 13:30:01,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:30:01,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:30:02,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:30:02,002 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-07-25 13:30:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:02,044 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 13:30:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:30:02,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-07-25 13:30:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:02,057 INFO L225 Difference]: With dead ends: 7 [2018-07-25 13:30:02,058 INFO L226 Difference]: Without dead ends: 4 [2018-07-25 13:30:02,061 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:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-07-25 13:30:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-07-25 13:30:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-07-25 13:30:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-07-25 13:30:02,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-07-25 13:30:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:02,101 INFO L472 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-07-25 13:30:02,101 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:30:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-07-25 13:30:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:30:02,102 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,102 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:30:02,102 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-07-25 13:30:02,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:02,218 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:02,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:02,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-25 13:30:02,225 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:30:02,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:30:02,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:30:02,226 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-07-25 13:30:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:02,259 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-07-25 13:30:02,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:30:02,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-07-25 13:30:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:02,260 INFO L225 Difference]: With dead ends: 6 [2018-07-25 13:30:02,260 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:30:02,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:30:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:30:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:30:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:30:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:30:02,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:30:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:02,268 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:30:02,268 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:30:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:30:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:30:02,268 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,268 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-07-25 13:30:02,269 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-07-25 13:30:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:02,369 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:02,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:02,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:30:02,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:30:02,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:30:02,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:30:02,371 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-07-25 13:30:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:02,410 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-07-25 13:30:02,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:30:02,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:30:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:02,418 INFO L225 Difference]: With dead ends: 7 [2018-07-25 13:30:02,418 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:30:02,419 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:30:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:30:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:30:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:30:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:30:02,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:30:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:02,424 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:30:02,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:30:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:30:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:30:02,425 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,425 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-07-25 13:30:02,425 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-07-25 13:30:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:02,519 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:02,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:02,520 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:30:02,520 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:30:02,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:30:02,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:30:02,521 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-07-25 13:30:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:02,571 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:30:02,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:30:02,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-07-25 13:30:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:02,572 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:30:02,572 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:30:02,572 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:30:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:30:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:30:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:30:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:30:02,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:30:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:02,577 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:30:02,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:30:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:30:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:30:02,578 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,578 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-07-25 13:30:02,578 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-07-25 13:30:02,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:02,640 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:02,641 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:02,641 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:30:02,641 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:30:02,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:30:02,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:30:02,642 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-07-25 13:30:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:02,708 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:30:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:30:02,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:30:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:02,711 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:30:02,711 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:30:02,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:30:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:30:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:30:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:30:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:30:02,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:30:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:02,724 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:30:02,724 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:30:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:30:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:30:02,725 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,725 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-07-25 13:30:02,726 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-07-25 13:30:02,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:02,847 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:02,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:02,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:30:02,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:30:02,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:30:02,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:30:02,850 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-07-25 13:30:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:02,913 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:30:02,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:30:02,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:30:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:02,914 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:30:02,914 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:30:02,915 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:30:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:30:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:30:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:30:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:30:02,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:30:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:02,931 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:30:02,931 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:30:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:30:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:30:02,932 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,932 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-07-25 13:30:02,932 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-07-25 13:30:02,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:02,994 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:02,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:02,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:30:02,996 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:30:02,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:30:02,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:30:02,997 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-07-25 13:30:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:03,033 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:30:03,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:30:03,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-07-25 13:30:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:03,034 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:30:03,035 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:30:03,035 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:30:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:30:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:30:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:30:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:30:03,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:30:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:03,041 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:30:03,041 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:30:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:30:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:30:03,042 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:03,042 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-07-25 13:30:03,043 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-07-25 13:30:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:03,115 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:03,116 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:03,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:30:03,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:30:03,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:30:03,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:30:03,117 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-07-25 13:30:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:03,160 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:30:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:30:03,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-07-25 13:30:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:03,161 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:30:03,162 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:30:03,162 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:30:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:30:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:30:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:30:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:30:03,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:30:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:03,168 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:30:03,169 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:30:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:30:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:30:03,169 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:03,170 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-07-25 13:30:03,170 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-07-25 13:30:03,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:03,242 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:03,242 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:03,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:30:03,243 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:30:03,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:30:03,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:30:03,244 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-07-25 13:30:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:03,289 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:30:03,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:30:03,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-07-25 13:30:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:03,291 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:30:03,291 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:30:03,292 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:30:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:30:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:30:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:30:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:30:03,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:30:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:03,301 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:30:03,301 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:30:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:30:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:30:03,302 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:03,303 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-07-25 13:30:03,303 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-07-25 13:30:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:03,403 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:03,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:03,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:30:03,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:30:03,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:30:03,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:30:03,405 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-07-25 13:30:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:03,479 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:30:03,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:30:03,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-07-25 13:30:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:03,480 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:30:03,480 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:30:03,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:30:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:30:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:30:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:30:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:30:03,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:30:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:03,491 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:30:03,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:30:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:30:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:30:03,492 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:03,492 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-07-25 13:30:03,492 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:03,493 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-07-25 13:30:03,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:03,591 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:03,592 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:03,592 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:30:03,592 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:30:03,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:30:03,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:30:03,593 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-07-25 13:30:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:03,651 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:30:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:30:03,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-07-25 13:30:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:03,653 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:30:03,653 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:30:03,653 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:30:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:30:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:30:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:30:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:30:03,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:30:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:03,660 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:30:03,661 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:30:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:30:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:30:03,661 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:03,661 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-07-25 13:30:03,662 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-07-25 13:30:03,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:03,765 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:03,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:03,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:30:03,766 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:30:03,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:30:03,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:30:03,767 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-07-25 13:30:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:03,833 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:30:03,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:30:03,833 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-07-25 13:30:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:03,834 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:30:03,834 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:30:03,835 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:30:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:30:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:30:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:30:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:30:03,842 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:30:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:03,843 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:30:03,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:30:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:30:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:30:03,844 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:03,844 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-07-25 13:30:03,844 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-07-25 13:30:03,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:03,964 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:03,965 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:03,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:30:03,965 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:30:03,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:30:03,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:30:03,967 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-07-25 13:30:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:04,042 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:30:04,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:30:04,043 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-07-25 13:30:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:04,044 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:30:04,044 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:30:04,045 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:30:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:30:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:30:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:30:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:30:04,057 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:30:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:04,058 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:30:04,059 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:30:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:30:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:30:04,059 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:04,060 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-07-25 13:30:04,060 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-07-25 13:30:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:04,218 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:04,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:04,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:30:04,222 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:30:04,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:30:04,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:30:04,223 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-07-25 13:30:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:04,315 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:30:04,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:30:04,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-07-25 13:30:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:04,318 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:30:04,318 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:30:04,319 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:30:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:30:04,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:30:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:30:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:30:04,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:30:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:04,336 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:30:04,336 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:30:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:30:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:30:04,337 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:04,337 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-07-25 13:30:04,338 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-07-25 13:30:04,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:04,487 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:04,488 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:04,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:30:04,488 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:30:04,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:30:04,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:30:04,489 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-07-25 13:30:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:04,582 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:30:04,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:30:04,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-07-25 13:30:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:04,583 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:30:04,583 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:30:04,584 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:30:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:30:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:30:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:30:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:30:04,594 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:30:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:04,595 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:30:04,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:30:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:30:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:30:04,596 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:04,596 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-07-25 13:30:04,596 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-07-25 13:30:04,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:04,764 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:04,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:04,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:30:04,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:30:04,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:30:04,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:30:04,770 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-07-25 13:30:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:04,873 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:30:04,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:30:04,874 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-07-25 13:30:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:04,875 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:30:04,875 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:30:04,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:30:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:30:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:30:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:30:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:30:04,887 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:30:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:04,887 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:30:04,888 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:30:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:30:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:30:04,888 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:04,889 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-07-25 13:30:04,889 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:04,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-07-25 13:30:04,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:05,075 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:05,076 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:05,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:30:05,077 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:30:05,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:30:05,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:30:05,078 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-07-25 13:30:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:05,197 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:30:05,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:30:05,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-07-25 13:30:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:05,200 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:30:05,200 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:30:05,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:30:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:30:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:30:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:30:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:30:05,215 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:30:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:05,215 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:30:05,215 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:30:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:30:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:30:05,216 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:05,216 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-07-25 13:30:05,217 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-07-25 13:30:05,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:05,388 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:05,389 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:05,389 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:30:05,389 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:30:05,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:30:05,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:30:05,393 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-07-25 13:30:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:05,519 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:30:05,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:30:05,519 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-07-25 13:30:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:05,520 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:30:05,520 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:30:05,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:30:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:30:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:30:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:30:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:30:05,535 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 13:30:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:05,536 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:30:05,536 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:30:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:30:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:30:05,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:05,538 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-07-25 13:30:05,538 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:05,538 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-07-25 13:30:05,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:05,731 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:05,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:05,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:30:05,732 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:30:05,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:30:05,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:30:05,733 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-07-25 13:30:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:05,926 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:30:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:30:05,927 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-07-25 13:30:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:05,927 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:30:05,927 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 13:30:05,928 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:30:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 13:30:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 13:30:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:30:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:30:05,939 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 13:30:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:05,939 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:30:05,939 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:30:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:30:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:30:05,940 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:05,940 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-07-25 13:30:05,940 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:05,941 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-07-25 13:30:05,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:06,120 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:06,120 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:06,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:30:06,121 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:30:06,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:30:06,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:30:06,122 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-07-25 13:30:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:06,264 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:30:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:30:06,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-07-25 13:30:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:06,265 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:30:06,265 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:30:06,266 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:30:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:30:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:30:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:30:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:30:06,283 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 13:30:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:06,284 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:30:06,284 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:30:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:30:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:30:06,285 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:06,285 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-07-25 13:30:06,285 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-07-25 13:30:06,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:06,532 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:06,532 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:06,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:30:06,533 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:30:06,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:30:06,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:30:06,534 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-07-25 13:30:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:06,682 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:30:06,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:30:06,682 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-07-25 13:30:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:06,683 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:30:06,683 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:30:06,684 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:30:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:30:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 13:30:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:30:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:30:06,697 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 13:30:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:06,697 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:30:06,697 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:30:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:30:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:30:06,698 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:06,698 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-07-25 13:30:06,699 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-07-25 13:30:06,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:06,877 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:06,878 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:06,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:30:06,878 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:30:06,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:30:06,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:30:06,879 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-07-25 13:30:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:07,026 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:30:07,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:30:07,026 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-07-25 13:30:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:07,027 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:30:07,027 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:30:07,028 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:30:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:30:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:30:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:30:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:30:07,042 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 13:30:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:07,042 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:30:07,042 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:30:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:30:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:30:07,043 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:07,043 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-07-25 13:30:07,044 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:07,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-07-25 13:30:07,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:07,234 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:07,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:07,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:30:07,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:30:07,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:30:07,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:30:07,236 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-07-25 13:30:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:07,389 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:30:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:30:07,390 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-07-25 13:30:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:07,390 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:30:07,390 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 13:30:07,391 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:30:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 13:30:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 13:30:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:30:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:30:07,405 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 13:30:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:07,405 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:30:07,405 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:30:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:30:07,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:30:07,406 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:07,406 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-07-25 13:30:07,406 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:07,407 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-07-25 13:30:07,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:07,605 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:07,606 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:07,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:30:07,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:30:07,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:30:07,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:30:07,607 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-07-25 13:30:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:07,809 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:30:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:30:07,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-07-25 13:30:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:07,810 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:30:07,810 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:30:07,811 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:30:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:30:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:30:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:30:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:30:07,834 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 13:30:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:07,834 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:30:07,834 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:30:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:30:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:30:07,835 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:07,835 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-07-25 13:30:07,836 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:07,837 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-07-25 13:30:07,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:08,074 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:08,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:08,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:30:08,075 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:30:08,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:30:08,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:30:08,076 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-07-25 13:30:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:08,267 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:30:08,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:30:08,267 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-07-25 13:30:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:08,267 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:30:08,268 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:30:08,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:30:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:30:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:30:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:30:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:30:08,286 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 13:30:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:08,286 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:30:08,287 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:30:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:30:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:30:08,287 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:08,287 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-07-25 13:30:08,288 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-07-25 13:30:08,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:08,538 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:08,539 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:08,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:30:08,539 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:30:08,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:30:08,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:30:08,540 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-07-25 13:30:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:08,758 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:30:08,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:30:08,759 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-07-25 13:30:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:08,760 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:30:08,760 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:30:08,760 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:30:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:30:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:30:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:30:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:30:08,781 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 13:30:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:08,782 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:30:08,782 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:30:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:30:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:30:08,783 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:08,783 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-07-25 13:30:08,783 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-07-25 13:30:08,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:09,138 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:09,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:09,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:30:09,139 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:30:09,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:30:09,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:30:09,141 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-07-25 13:30:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:09,351 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:30:09,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:30:09,352 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-07-25 13:30:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:09,352 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:30:09,352 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:30:09,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:30:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:30:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 13:30:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:30:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:30:09,374 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 13:30:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:09,375 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:30:09,375 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:30:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:30:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:30:09,376 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:09,376 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-07-25 13:30:09,376 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-07-25 13:30:09,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:09,663 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:09,663 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:09,663 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:30:09,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:30:09,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:30:09,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:30:09,665 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-07-25 13:30:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:09,903 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:30:09,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:30:09,904 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-07-25 13:30:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:09,904 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:30:09,905 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:30:09,905 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:30:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:30:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:30:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:30:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:30:09,933 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 13:30:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:09,933 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:30:09,933 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:30:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:30:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:30:09,934 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:09,934 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-07-25 13:30:09,934 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-07-25 13:30:09,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:10,224 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:10,224 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:10,224 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:30:10,224 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:30:10,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:30:10,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:30:10,226 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-07-25 13:30:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:10,476 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:30:10,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:30:10,477 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-07-25 13:30:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:10,477 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:30:10,478 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:30:10,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:30:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:30:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:30:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:30:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:30:10,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 13:30:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:10,503 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:30:10,503 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:30:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:30:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:30:10,503 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:10,503 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-07-25 13:30:10,504 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:10,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-07-25 13:30:10,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:10,808 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:10,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:10,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:30:10,809 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:30:10,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:30:10,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:30:10,810 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-07-25 13:30:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:11,084 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:30:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:30:11,085 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-07-25 13:30:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:11,085 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:30:11,085 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:30:11,086 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:30:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:30:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:30:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:30:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:30:11,114 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 13:30:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:11,114 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:30:11,114 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:30:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:30:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:30:11,115 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:11,115 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-07-25 13:30:11,115 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-07-25 13:30:11,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:11,446 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:11,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:11,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:30:11,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:30:11,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:30:11,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:30:11,448 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-07-25 13:30:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:11,733 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:30:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:30:11,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-07-25 13:30:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:11,734 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:30:11,734 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:30:11,735 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:30:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:30:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 13:30:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:30:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:30:11,762 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 13:30:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:11,763 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:30:11,763 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:30:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:30:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:30:11,763 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:11,764 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-07-25 13:30:11,764 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-07-25 13:30:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:12,071 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:12,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:12,072 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:30:12,072 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:30:12,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:30:12,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:30:12,073 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-07-25 13:30:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:12,362 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:30:12,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:30:12,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-07-25 13:30:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:12,363 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:30:12,364 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:30:12,364 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:30:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:30:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:30:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:30:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:30:12,393 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 13:30:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:12,394 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:30:12,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:30:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:30:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:30:12,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:12,395 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-07-25 13:30:12,395 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:12,395 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-07-25 13:30:12,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:12,699 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:12,699 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:12,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:30:12,700 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:30:12,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:30:12,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:30:12,701 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-07-25 13:30:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:12,945 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:30:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:30:12,946 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-07-25 13:30:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:12,946 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:30:12,946 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:30:12,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:30:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:30:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 13:30:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:30:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:30:12,972 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 13:30:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:12,973 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:30:12,973 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:30:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:30:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:30:12,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:12,973 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-07-25 13:30:12,974 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:12,974 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-07-25 13:30:12,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:13,226 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:13,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:13,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:30:13,227 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:30:13,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:30:13,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:30:13,228 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-07-25 13:30:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:13,505 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:30:13,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:30:13,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-07-25 13:30:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:13,506 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:30:13,506 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:30:13,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:30:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:30:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:30:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:30:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:30:13,534 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 13:30:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:13,535 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:30:13,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:30:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:30:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:30:13,535 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:13,535 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-07-25 13:30:13,536 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-07-25 13:30:13,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:13,810 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:13,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:13,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:30:13,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:30:13,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:30:13,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:30:13,812 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-07-25 13:30:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:14,084 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:30:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:30:14,084 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-07-25 13:30:14,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:14,085 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:30:14,085 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:30:14,086 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:30:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:30:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:30:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:30:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:30:14,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 13:30:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:14,114 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:30:14,114 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:30:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:30:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:30:14,114 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:14,114 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-07-25 13:30:14,115 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-07-25 13:30:14,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:14,378 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:14,379 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:14,379 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:30:14,379 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:30:14,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:30:14,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:30:14,380 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-07-25 13:30:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:14,665 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:30:14,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:30:14,666 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-07-25 13:30:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:14,666 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:30:14,666 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:30:14,667 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:30:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:30:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:30:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:30:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:30:14,697 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 13:30:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:14,697 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:30:14,698 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:30:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:30:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:30:14,698 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:14,698 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-07-25 13:30:14,699 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-07-25 13:30:14,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:14,985 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:14,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:14,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:30:14,985 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:30:14,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:30:14,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:30:14,987 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-07-25 13:30:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:15,287 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:30:15,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:30:15,287 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-07-25 13:30:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:15,288 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:30:15,288 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 13:30:15,289 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:30:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 13:30:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 13:30:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:30:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:30:15,323 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 13:30:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:15,323 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:30:15,323 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:30:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:30:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:30:15,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:15,325 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-07-25 13:30:15,326 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-07-25 13:30:15,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:15,660 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:15,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:15,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:30:15,661 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:30:15,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:30:15,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:30:15,663 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-07-25 13:30:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:15,983 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:30:15,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:30:15,984 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-07-25 13:30:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:15,984 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:30:15,984 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:30:15,985 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:30:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:30:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:30:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:30:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:30:16,014 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 13:30:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:16,015 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:30:16,016 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:30:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:30:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:30:16,016 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:16,016 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-07-25 13:30:16,017 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:16,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-07-25 13:30:16,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:16,301 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:16,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:16,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:30:16,302 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:30:16,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:30:16,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:30:16,303 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-07-25 13:30:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:16,595 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:30:16,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:30:16,596 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-07-25 13:30:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:16,596 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:30:16,596 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 13:30:16,597 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:30:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 13:30:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 13:30:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:30:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:30:16,623 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 13:30:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:16,623 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:30:16,623 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:30:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:30:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:30:16,623 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:16,624 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-07-25 13:30:16,624 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:16,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-07-25 13:30:16,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:16,906 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:16,906 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:16,906 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:30:16,906 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:30:16,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:30:16,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:30:16,908 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-07-25 13:30:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:17,207 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:30:17,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:30:17,208 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-07-25 13:30:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:17,208 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:30:17,208 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:30:17,210 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:30:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:30:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:30:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:30:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:30:17,242 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 13:30:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:17,242 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:30:17,242 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:30:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:30:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:30:17,243 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:17,243 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-07-25 13:30:17,243 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-07-25 13:30:17,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:17,546 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:17,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:17,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:30:17,546 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:30:17,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:30:17,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:30:17,548 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-07-25 13:30:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:17,857 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:30:17,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:30:17,857 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-07-25 13:30:17,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:17,858 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:30:17,858 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:30:17,859 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:30:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:30:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 13:30:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:30:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:30:17,885 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 13:30:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:17,885 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:30:17,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:30:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:30:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:30:17,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:17,886 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-07-25 13:30:17,886 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-07-25 13:30:17,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:18,194 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:18,195 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:18,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:30:18,195 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:30:18,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:30:18,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:30:18,196 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-07-25 13:30:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:18,523 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:30:18,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:30:18,524 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-07-25 13:30:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:18,524 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:30:18,524 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:30:18,525 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:30:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:30:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:30:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:30:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:30:18,556 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 13:30:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:18,556 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:30:18,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:30:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:30:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:30:18,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:18,557 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-07-25 13:30:18,557 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:18,558 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-07-25 13:30:18,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:18,851 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:18,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:18,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:30:18,851 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:30:18,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:30:18,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:30:18,853 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-07-25 13:30:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:19,123 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:30:19,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:30:19,123 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-07-25 13:30:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:19,124 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:30:19,124 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 13:30:19,125 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:30:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 13:30:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 13:30:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:30:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:30:19,163 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 13:30:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:19,164 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:30:19,164 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:30:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:30:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:30:19,165 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:19,165 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-07-25 13:30:19,165 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-07-25 13:30:19,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:19,489 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:19,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:19,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:30:19,490 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:30:19,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:30:19,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:30:19,492 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-07-25 13:30:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:19,850 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 13:30:19,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:30:19,850 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-07-25 13:30:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:19,851 INFO L225 Difference]: With dead ends: 48 [2018-07-25 13:30:19,851 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:30:19,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:30:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:30:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:30:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:30:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:30:19,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 13:30:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:19,886 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:30:19,887 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:30:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:30:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:30:19,887 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:19,887 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-07-25 13:30:19,888 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-07-25 13:30:19,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:20,214 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:20,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:20,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:30:20,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:30:20,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:30:20,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:30:20,216 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-07-25 13:30:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:20,576 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:30:20,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:30:20,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-07-25 13:30:20,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:20,576 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:30:20,577 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 13:30:20,577 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:30:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 13:30:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 13:30:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:30:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 13:30:20,613 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 13:30:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:20,613 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 13:30:20,614 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:30:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 13:30:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 13:30:20,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:20,615 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-07-25 13:30:20,616 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-07-25 13:30:20,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:20,962 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:20,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:20,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:30:20,963 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:30:20,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:30:20,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:30:20,964 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-07-25 13:30:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:21,404 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:30:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:30:21,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-07-25 13:30:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:21,405 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:30:21,405 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:30:21,406 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:30:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:30:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:30:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:30:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:30:21,449 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 13:30:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:21,449 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:30:21,449 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:30:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:30:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:30:21,450 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:21,450 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-07-25 13:30:21,450 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-07-25 13:30:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:21,848 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:21,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:21,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:30:21,849 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:30:21,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:30:21,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:30:21,850 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-07-25 13:30:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:22,248 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:30:22,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:30:22,249 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-07-25 13:30:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:22,250 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:30:22,250 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 13:30:22,251 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:30:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 13:30:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 13:30:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 13:30:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 13:30:22,291 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 13:30:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:22,291 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 13:30:22,291 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:30:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 13:30:22,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:30:22,292 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:22,292 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-07-25 13:30:22,292 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:22,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-07-25 13:30:22,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:22,682 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:22,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:22,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:30:22,683 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:30:22,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:30:22,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:30:22,684 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-07-25 13:30:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:23,066 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 13:30:23,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:30:23,066 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-07-25 13:30:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:23,067 INFO L225 Difference]: With dead ends: 52 [2018-07-25 13:30:23,067 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:30:23,068 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:30:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:30:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:30:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:30:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:30:23,105 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 13:30:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:23,105 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:30:23,105 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:30:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:30:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:30:23,106 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:23,106 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-07-25 13:30:23,106 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-07-25 13:30:23,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:23,469 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:23,470 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:23,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:30:23,470 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:30:23,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:30:23,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:30:23,471 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-07-25 13:30:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:23,873 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:30:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:30:23,873 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-07-25 13:30:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:23,874 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:30:23,874 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 13:30:23,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:30:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 13:30:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 13:30:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 13:30:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 13:30:23,917 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 13:30:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:23,918 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 13:30:23,918 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:30:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 13:30:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 13:30:23,918 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:23,919 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-07-25 13:30:23,919 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:23,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-07-25 13:30:23,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:24,342 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:24,342 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:24,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:30:24,343 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:30:24,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:30:24,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:30:24,344 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-07-25 13:30:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:24,810 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 13:30:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:30:24,811 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-07-25 13:30:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:24,812 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:30:24,812 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:30:24,812 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:30:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:30:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:30:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:30:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:30:24,852 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 13:30:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:24,852 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:30:24,852 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:30:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:30:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:30:24,853 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:24,853 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-07-25 13:30:24,853 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-07-25 13:30:24,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:25,190 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:25,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:25,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:30:25,191 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:30:25,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:30:25,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:30:25,192 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-07-25 13:30:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:25,470 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:30:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:30:25,470 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-07-25 13:30:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:25,470 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:30:25,471 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 13:30:25,471 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:30:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 13:30:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 13:30:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 13:30:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 13:30:25,508 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 13:30:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:25,508 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 13:30:25,508 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:30:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 13:30:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 13:30:25,509 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:25,509 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-07-25 13:30:25,509 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-07-25 13:30:25,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:25,935 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:25,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:25,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:30:25,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:30:25,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:30:25,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:30:25,937 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-07-25 13:30:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:26,386 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 13:30:26,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:30:26,386 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-07-25 13:30:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:26,387 INFO L225 Difference]: With dead ends: 56 [2018-07-25 13:30:26,387 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:30:26,388 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:30:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:30:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:30:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:30:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:30:26,428 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 13:30:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:26,428 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:30:26,428 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:30:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:30:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:30:26,429 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:26,429 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-07-25 13:30:26,429 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-07-25 13:30:26,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:26,806 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:26,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:26,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:30:26,806 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:30:26,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:30:26,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:30:26,807 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-07-25 13:30:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:27,135 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:30:27,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:30:27,135 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-07-25 13:30:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:27,136 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:30:27,136 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 13:30:27,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:30:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 13:30:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 13:30:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:30:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:30:27,170 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 13:30:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:27,170 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:30:27,170 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:30:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:30:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:30:27,171 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:27,171 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-07-25 13:30:27,171 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-07-25 13:30:27,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:27,496 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:27,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:27,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:30:27,497 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:30:27,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:30:27,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:30:27,498 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-07-25 13:30:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:27,791 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 13:30:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:30:27,791 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-07-25 13:30:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:27,792 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:30:27,792 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:30:27,793 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:30:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:30:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:30:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:30:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:30:27,821 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 13:30:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:27,821 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:30:27,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:30:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:30:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:30:27,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:27,822 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-07-25 13:30:27,823 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-07-25 13:30:27,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:28,283 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:28,283 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:28,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:30:28,283 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:30:28,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:30:28,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:30:28,284 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-07-25 13:30:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:28,605 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:30:28,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:30:28,605 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-07-25 13:30:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:28,606 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:30:28,606 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 13:30:28,606 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:30:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 13:30:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 13:30:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 13:30:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 13:30:28,634 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 13:30:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:28,634 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 13:30:28,634 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:30:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 13:30:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:30:28,635 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:28,635 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-07-25 13:30:28,635 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-07-25 13:30:28,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:28,991 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:28,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:28,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:30:28,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:30:28,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:30:28,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:30:28,993 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-07-25 13:30:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:29,527 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:30:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:30:29,528 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-07-25 13:30:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:29,528 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:30:29,528 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:30:29,529 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:30:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:30:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:30:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:30:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:30:29,578 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 13:30:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:29,578 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:30:29,579 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:30:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:30:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:30:29,579 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:29,579 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-07-25 13:30:29,580 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-07-25 13:30:29,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:30,107 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:30,107 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:30,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:30:30,107 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:30:30,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:30:30,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:30:30,108 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-07-25 13:30:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:30,440 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:30:30,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:30:30,441 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-07-25 13:30:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:30,441 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:30:30,441 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:30:30,442 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:30:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:30:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 13:30:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:30:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 13:30:30,471 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 13:30:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:30,471 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 13:30:30,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:30:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 13:30:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 13:30:30,471 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:30,471 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-07-25 13:30:30,472 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:30,472 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-07-25 13:30:30,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:30,783 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:30,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:30,783 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:30:30,783 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:30:30,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:30:30,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:30:30,784 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-07-25 13:30:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:31,131 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 13:30:31,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:30:31,131 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-07-25 13:30:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:31,131 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:30:31,131 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:30:31,132 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:30:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:30:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:30:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:30:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:30:31,166 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 13:30:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:31,166 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:30:31,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:30:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:30:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:30:31,166 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:31,166 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-07-25 13:30:31,167 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-07-25 13:30:31,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:31,580 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:31,580 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:31,580 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:30:31,581 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:30:31,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:30:31,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:30:31,582 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-07-25 13:30:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:31,978 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:30:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:30:31,978 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-07-25 13:30:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:31,979 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:30:31,979 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 13:30:31,980 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:30:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 13:30:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 13:30:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 13:30:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 13:30:32,027 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 13:30:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:32,028 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 13:30:32,028 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:30:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 13:30:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 13:30:32,028 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:32,028 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-07-25 13:30:32,029 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-07-25 13:30:32,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:32,515 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:32,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:32,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:30:32,516 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:30:32,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:30:32,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:30:32,517 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-07-25 13:30:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:32,907 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 13:30:32,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:30:32,908 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-07-25 13:30:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:32,908 INFO L225 Difference]: With dead ends: 64 [2018-07-25 13:30:32,908 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:30:32,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:30:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:30:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:30:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:30:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:30:32,943 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 13:30:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:32,943 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:30:32,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:30:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:30:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:30:32,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:32,944 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-07-25 13:30:32,944 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-07-25 13:30:32,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:33,306 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:33,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:33,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:30:33,307 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:30:33,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:30:33,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:30:33,308 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-07-25 13:30:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:33,722 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:30:33,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:30:33,722 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-07-25 13:30:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:33,722 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:30:33,723 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 13:30:33,723 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:30:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 13:30:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 13:30:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 13:30:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 13:30:33,770 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 13:30:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:33,770 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 13:30:33,770 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:30:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 13:30:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 13:30:33,771 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:33,771 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-07-25 13:30:33,771 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:33,772 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-07-25 13:30:33,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:34,161 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:34,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:34,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:30:34,161 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:30:34,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:30:34,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:30:34,162 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-07-25 13:30:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:34,578 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 13:30:34,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:30:34,578 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-07-25 13:30:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:34,579 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:30:34,579 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:30:34,579 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:30:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:30:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:30:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:30:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:30:34,619 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 13:30:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:34,619 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:30:34,619 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:30:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:30:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:30:34,620 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:34,620 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-07-25 13:30:34,621 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-07-25 13:30:34,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:35,097 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:30:35,097 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:35,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:30:35,098 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:30:35,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:30:35,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:30:35,099 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-07-25 13:30:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:35,514 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:30:35,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:30:35,514 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-07-25 13:30:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:35,515 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:30:35,515 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 13:30:35,515 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:30:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 13:30:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 13:30:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:30:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:30:35,558 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 13:30:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:35,558 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:30:35,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:30:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:30:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:30:35,559 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:35,559 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-07-25 13:30:35,560 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:35,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-07-25 13:30:35,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:35,994 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:30:35,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:35,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:30:35,996 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:30:35,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:30:35,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:30:35,997 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-07-25 13:30:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:36,462 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 13:30:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:30:36,462 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-07-25 13:30:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:36,463 INFO L225 Difference]: With dead ends: 68 [2018-07-25 13:30:36,463 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:30:36,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:30:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:30:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:30:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:30:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:30:36,506 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 13:30:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:36,506 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:30:36,506 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:30:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:30:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:30:36,507 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:36,507 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-07-25 13:30:36,507 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:36,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-07-25 13:30:36,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:36,971 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:30:36,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:36,972 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:30:36,972 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:30:36,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:30:36,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:30:36,973 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-07-25 13:30:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:37,523 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:30:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:30:37,524 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-07-25 13:30:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:37,525 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:30:37,525 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 13:30:37,526 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:30:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 13:30:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 13:30:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 13:30:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 13:30:37,577 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 13:30:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:37,577 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 13:30:37,578 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:30:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 13:30:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:30:37,578 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:37,578 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-07-25 13:30:37,579 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-07-25 13:30:37,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:38,277 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:30:38,278 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:38,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:30:38,278 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:30:38,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:30:38,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:30:38,279 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-07-25 13:30:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:38,783 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:30:38,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:30:38,783 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-07-25 13:30:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:38,783 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:30:38,784 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:30:38,784 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:30:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:30:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:30:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:30:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:30:38,824 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 13:30:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:38,824 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:30:38,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:30:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:30:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:30:38,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:38,825 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-07-25 13:30:38,825 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-07-25 13:30:38,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:39,228 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:30:39,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:39,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:30:39,229 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:30:39,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:30:39,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:30:39,230 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-07-25 13:30:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:39,719 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:30:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:30:39,720 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-07-25 13:30:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:39,720 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:30:39,720 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 13:30:39,721 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:30:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 13:30:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 13:30:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:30:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 13:30:39,765 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 13:30:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:39,765 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 13:30:39,765 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:30:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 13:30:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:30:39,766 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:39,766 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-07-25 13:30:39,766 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-07-25 13:30:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:40,215 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:30:40,216 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:40,216 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:30:40,216 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:30:40,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:30:40,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:30:40,217 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-07-25 13:30:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:40,695 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 13:30:40,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:30:40,695 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-07-25 13:30:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:40,696 INFO L225 Difference]: With dead ends: 72 [2018-07-25 13:30:40,696 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:30:40,696 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:30:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:30:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:30:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:30:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:30:40,737 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 13:30:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:40,737 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:30:40,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:30:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:30:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:30:40,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:40,738 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-07-25 13:30:40,738 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-07-25 13:30:40,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:41,190 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:30:41,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:41,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:30:41,191 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:30:41,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:30:41,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:30:41,192 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-07-25 13:30:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:41,671 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:30:41,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:30:41,671 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-07-25 13:30:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:41,672 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:30:41,672 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 13:30:41,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:30:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 13:30:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 13:30:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:30:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 13:30:41,715 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 13:30:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:41,715 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 13:30:41,715 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:30:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 13:30:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 13:30:41,716 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:41,716 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-07-25 13:30:41,716 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-07-25 13:30:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:42,142 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:30:42,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:42,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:30:42,142 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:30:42,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:30:42,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:30:42,143 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-07-25 13:30:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:42,630 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 13:30:42,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:30:42,631 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-07-25 13:30:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:42,631 INFO L225 Difference]: With dead ends: 74 [2018-07-25 13:30:42,631 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:30:42,632 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:30:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:30:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:30:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:30:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:30:42,675 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 13:30:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:42,675 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:30:42,675 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:30:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:30:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:30:42,675 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:42,676 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-07-25 13:30:42,676 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-07-25 13:30:42,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:43,208 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:30:43,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:43,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:30:43,209 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:30:43,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:30:43,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:30:43,209 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-07-25 13:30:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:43,711 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:30:43,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:30:43,712 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-07-25 13:30:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:43,712 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:30:43,713 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 13:30:43,713 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:30:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 13:30:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 13:30:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:30:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 13:30:43,758 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 13:30:43,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:43,758 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 13:30:43,758 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:30:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 13:30:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:30:43,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:43,759 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-07-25 13:30:43,759 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-07-25 13:30:43,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:44,206 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:30:44,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:44,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:30:44,207 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:30:44,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:30:44,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:30:44,208 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-07-25 13:30:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:44,718 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 13:30:44,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:30:44,718 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-07-25 13:30:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:44,719 INFO L225 Difference]: With dead ends: 76 [2018-07-25 13:30:44,719 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:30:44,720 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:30:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:30:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:30:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:30:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:30:44,767 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 13:30:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:44,767 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:30:44,767 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:30:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:30:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:30:44,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:44,768 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-07-25 13:30:44,768 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:44,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-07-25 13:30:44,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:45,376 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:30:45,376 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:45,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:30:45,377 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:30:45,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:30:45,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:30:45,378 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-07-25 13:30:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:45,929 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:30:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:30:45,930 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-07-25 13:30:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:45,930 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:30:45,930 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:30:45,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:30:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:30:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 13:30:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:30:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:30:45,993 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 13:30:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:45,993 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:30:45,993 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:30:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:30:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:30:45,994 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:45,994 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-07-25 13:30:45,994 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-07-25 13:30:45,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:46,469 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:30:46,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:46,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:30:46,470 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:30:46,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:30:46,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:30:46,470 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-07-25 13:30:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:47,076 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 13:30:47,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:30:47,076 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-07-25 13:30:47,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:47,077 INFO L225 Difference]: With dead ends: 78 [2018-07-25 13:30:47,077 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:30:47,078 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:30:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:30:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:30:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:30:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:30:47,145 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 13:30:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:47,146 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:30:47,146 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:30:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:30:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:30:47,146 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:47,147 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-07-25 13:30:47,147 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-07-25 13:30:47,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,638 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:30:47,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:30:47,639 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:30:47,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:30:47,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:30:47,640 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-07-25 13:30:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,236 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:30:48,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:30:48,236 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-07-25 13:30:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,237 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:30:48,237 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:30:48,238 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:30:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:30:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 13:30:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:30:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 13:30:48,298 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 13:30:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,298 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 13:30:48,298 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:30:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 13:30:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 13:30:48,299 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,299 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-07-25 13:30:48,299 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-07-25 13:30:48,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,902 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:30:48,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:30:48,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:30:48,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:30:48,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:30:48,904 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-07-25 13:30:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,554 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:30:49,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:30:49,554 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-07-25 13:30:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,555 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:30:49,555 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:30:49,556 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:30:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:30:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:30:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:30:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:30:49,613 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 13:30:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,613 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:30:49,613 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:30:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:30:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:30:49,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,614 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-07-25 13:30:49,614 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-07-25 13:30:49,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:50,189 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:30:50,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:50,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:30:50,190 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:30:50,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:30:50,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:30:50,190 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-07-25 13:30:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:50,826 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:30:50,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:30:50,827 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-07-25 13:30:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:50,827 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:30:50,828 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 13:30:50,828 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:30:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 13:30:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 13:30:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:30:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 13:30:50,883 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 13:30:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:50,883 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 13:30:50,883 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:30:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 13:30:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:30:50,884 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:50,884 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-07-25 13:30:50,884 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-07-25 13:30:50,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:51,500 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:30:51,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:51,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:30:51,500 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:30:51,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:30:51,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:30:51,501 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-07-25 13:30:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:52,161 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 13:30:52,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:30:52,161 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-07-25 13:30:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:52,162 INFO L225 Difference]: With dead ends: 82 [2018-07-25 13:30:52,162 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:30:52,162 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:30:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:30:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:30:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:30:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:30:52,225 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 13:30:52,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:52,225 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:30:52,225 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:30:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:30:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:30:52,226 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:52,226 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-07-25 13:30:52,226 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-07-25 13:30:52,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:53,076 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:30:53,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:53,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:30:53,077 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:30:53,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:30:53,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:30:53,078 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-07-25 13:30:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:53,790 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:30:53,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:30:53,790 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-07-25 13:30:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:53,791 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:30:53,791 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:30:53,791 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:30:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:30:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 13:30:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 13:30:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 13:30:53,858 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 13:30:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:53,858 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 13:30:53,858 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:30:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 13:30:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 13:30:53,859 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:53,859 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-07-25 13:30:53,859 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-07-25 13:30:53,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:54,471 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:30:54,472 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:54,472 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:30:54,472 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:30:54,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:30:54,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:30:54,473 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-07-25 13:30:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:55,269 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 13:30:55,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:30:55,269 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-07-25 13:30:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:55,270 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:30:55,270 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:30:55,271 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:30:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:30:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:30:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:30:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:30:55,343 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 13:30:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:55,343 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:30:55,343 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:30:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:30:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:30:55,344 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:55,344 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-07-25 13:30:55,344 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-07-25 13:30:55,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:55,974 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:30:55,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:55,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:30:55,975 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:30:55,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:30:55,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:30:55,976 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-07-25 13:30:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:56,685 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:30:56,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:30:56,685 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-07-25 13:30:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:56,686 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:30:56,686 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 13:30:56,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:30:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 13:30:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 13:30:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:30:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 13:30:56,751 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 13:30:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:56,751 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 13:30:56,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:30:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 13:30:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 13:30:56,752 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:56,752 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-07-25 13:30:56,752 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-07-25 13:30:56,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:57,410 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:30:57,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:57,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:30:57,411 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:30:57,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:30:57,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:30:57,411 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-07-25 13:30:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:58,159 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 13:30:58,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:30:58,160 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-07-25 13:30:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:58,161 INFO L225 Difference]: With dead ends: 86 [2018-07-25 13:30:58,161 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:30:58,161 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:30:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:30:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:30:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:30:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:30:58,259 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 13:30:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:58,260 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:30:58,260 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:30:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:30:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:30:58,261 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:58,261 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-07-25 13:30:58,261 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-07-25 13:30:58,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:58,996 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:30:58,996 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:58,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:30:58,997 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:30:58,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:30:58,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:30:58,998 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-07-25 13:30:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:59,750 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:30:59,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:30:59,750 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-07-25 13:30:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:59,751 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:30:59,751 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 13:30:59,751 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:30:59,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 13:30:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 13:30:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:30:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:30:59,822 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 13:30:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:59,822 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:30:59,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:30:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:30:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:30:59,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:59,823 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-07-25 13:30:59,823 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-07-25 13:30:59,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:00,490 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:00,491 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:00,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:31:00,491 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:31:00,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:31:00,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:31:00,493 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-07-25 13:31:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:01,278 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 13:31:01,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:31:01,278 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-07-25 13:31:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:01,278 INFO L225 Difference]: With dead ends: 88 [2018-07-25 13:31:01,279 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:31:01,279 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:31:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:31:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:31:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:31:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:31:01,348 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 13:31:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:01,348 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:31:01,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:31:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:31:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:31:01,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:01,349 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-07-25 13:31:01,349 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-07-25 13:31:01,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:02,121 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:02,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:02,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:31:02,122 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:31:02,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:31:02,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:31:02,123 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-07-25 13:31:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:02,875 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:31:02,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:31:02,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-07-25 13:31:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:02,876 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:31:02,876 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 13:31:02,877 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:31:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 13:31:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 13:31:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 13:31:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 13:31:02,960 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 13:31:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:02,961 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 13:31:02,961 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:31:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 13:31:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 13:31:02,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:02,962 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-07-25 13:31:02,962 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:02,963 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-07-25 13:31:02,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:03,732 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:03,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:03,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:31:03,733 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:31:03,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:31:03,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:31:03,734 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-07-25 13:31:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:04,565 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:31:04,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:31:04,565 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-07-25 13:31:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:04,566 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:31:04,566 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:31:04,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:31:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:31:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:31:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:31:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:31:04,638 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 13:31:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:04,639 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:31:04,639 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:31:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:31:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:31:04,640 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:04,640 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-07-25 13:31:04,640 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-07-25 13:31:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:05,398 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:05,398 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:05,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:31:05,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:31:05,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:31:05,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:31:05,400 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-07-25 13:31:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:06,200 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:31:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:31:06,200 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-07-25 13:31:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:06,200 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:31:06,201 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 13:31:06,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:31:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 13:31:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 13:31:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 13:31:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 13:31:06,272 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 13:31:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:06,272 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 13:31:06,272 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:31:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 13:31:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 13:31:06,273 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:06,273 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-07-25 13:31:06,273 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-07-25 13:31:06,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:07,000 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:07,001 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:07,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:31:07,001 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:31:07,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:31:07,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:31:07,002 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-07-25 13:31:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:07,852 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 13:31:07,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:31:07,852 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-07-25 13:31:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:07,853 INFO L225 Difference]: With dead ends: 92 [2018-07-25 13:31:07,853 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:31:07,854 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:31:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:31:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:31:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:31:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:31:07,933 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 13:31:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:07,933 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:31:07,933 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:31:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:31:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:31:07,934 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:07,934 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-07-25 13:31:07,934 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:07,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-07-25 13:31:07,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:08,799 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:08,799 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:08,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:31:08,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:31:08,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:31:08,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:31:08,800 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-07-25 13:31:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:09,620 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:31:09,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:31:09,620 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-07-25 13:31:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:09,621 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:31:09,621 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 13:31:09,622 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:31:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 13:31:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 13:31:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 13:31:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 13:31:09,697 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 13:31:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:09,697 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 13:31:09,697 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:31:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 13:31:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 13:31:09,698 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:09,698 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-07-25 13:31:09,698 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:09,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-07-25 13:31:09,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:10,486 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:10,486 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:10,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:31:10,486 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:31:10,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:31:10,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:31:10,487 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-07-25 13:31:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:11,371 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 13:31:11,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:31:11,371 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-07-25 13:31:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:11,372 INFO L225 Difference]: With dead ends: 94 [2018-07-25 13:31:11,372 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:31:11,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:31:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:31:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:31:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:31:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:31:11,448 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 13:31:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:11,448 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:31:11,448 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:31:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:31:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:31:11,449 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:11,449 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-07-25 13:31:11,449 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-07-25 13:31:11,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:12,261 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,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:12,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:31:12,262 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:31:12,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:31:12,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:31:12,263 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-07-25 13:31:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:13,130 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:31:13,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:31:13,130 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-07-25 13:31:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:13,130 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:31:13,130 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 13:31:13,131 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:31:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 13:31:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 13:31:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 13:31:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 13:31:13,208 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 13:31:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:13,209 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 13:31:13,209 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:31:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 13:31:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 13:31:13,209 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:13,209 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-07-25 13:31:13,209 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-07-25 13:31:13,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:14,003 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:14,003 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:14,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:31:14,004 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:31:14,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:31:14,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:31:14,005 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-07-25 13:31:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:14,931 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 13:31:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:31:14,932 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-07-25 13:31:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:14,932 INFO L225 Difference]: With dead ends: 96 [2018-07-25 13:31:14,932 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:31:14,933 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:31:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:31:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:31:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:31:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:31:15,013 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 13:31:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:15,013 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:31:15,013 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:31:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:31:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:31:15,013 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:15,013 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-07-25 13:31:15,014 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-07-25 13:31:15,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,916 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:15,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:15,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:31:15,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:31:15,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:31:15,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:31:15,917 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-07-25 13:31:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:16,838 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:31:16,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:31:16,839 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-07-25 13:31:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:16,839 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:31:16,840 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 13:31:16,840 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:31:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 13:31:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 13:31:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:31:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 13:31:16,961 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 13:31:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:16,961 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 13:31:16,962 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:31:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 13:31:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:31:16,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:16,962 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-07-25 13:31:16,963 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-07-25 13:31:16,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:17,958 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:17,958 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:17,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:31:17,959 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:31:17,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:31:17,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:31:17,960 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-07-25 13:31:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:18,939 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 13:31:18,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:31:18,939 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-07-25 13:31:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:18,940 INFO L225 Difference]: With dead ends: 98 [2018-07-25 13:31:18,940 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:31:18,941 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:31:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:31:19,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:31:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:31:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:31:19,019 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 13:31:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:19,019 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:31:19,019 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:31:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:31:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:31:19,020 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:19,020 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-07-25 13:31:19,020 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-07-25 13:31:19,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:19,874 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:19,874 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:19,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:31:19,875 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:31:19,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:31:19,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:31:19,876 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-07-25 13:31:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:20,810 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:31:20,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:31:20,810 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-07-25 13:31:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:20,811 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:31:20,811 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 13:31:20,812 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:31:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 13:31:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 13:31:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 13:31:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 13:31:20,897 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 13:31:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:20,897 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 13:31:20,898 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:31:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 13:31:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 13:31:20,898 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:20,898 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-07-25 13:31:20,899 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-07-25 13:31:20,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:21,792 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:21,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:21,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:31:21,793 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:31:21,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:31:21,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:31:21,794 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-07-25 13:31:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:22,799 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 13:31:22,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:31:22,800 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-07-25 13:31:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:22,800 INFO L225 Difference]: With dead ends: 100 [2018-07-25 13:31:22,801 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:31:22,801 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:31:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:31:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:31:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:31:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:31:22,885 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 13:31:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:22,886 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:31:22,886 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:31:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:31:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:31:22,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:22,886 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-07-25 13:31:22,886 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:22,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-07-25 13:31:22,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:23,858 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:23,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:23,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:31:23,858 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:31:23,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:31:23,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:31:23,859 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-07-25 13:31:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:24,879 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:31:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:31:24,880 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-07-25 13:31:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:24,880 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:31:24,881 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 13:31:24,881 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:31:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 13:31:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 13:31:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:31:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 13:31:24,972 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 13:31:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:24,972 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 13:31:24,972 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:31:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 13:31:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 13:31:24,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:24,973 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-07-25 13:31:24,973 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-07-25 13:31:24,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:25,777 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:25,777 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:25,778 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:31:25,778 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:31:25,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:31:25,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:31:25,779 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-07-25 13:31:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:26,840 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 13:31:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:31:26,840 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-07-25 13:31:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:26,841 INFO L225 Difference]: With dead ends: 102 [2018-07-25 13:31:26,841 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:31:26,842 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:31:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:31:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:31:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:31:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:31:26,932 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 13:31:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:26,933 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:31:26,933 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:31:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:31:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:31:26,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:26,933 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-07-25 13:31:26,934 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:26,934 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-07-25 13:31:26,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:27,880 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:27,881 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:27,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:31:27,881 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:31:27,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:31:27,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:31:27,882 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-07-25 13:31:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:28,908 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:31:28,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:31:28,909 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-07-25 13:31:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:28,910 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:31:28,911 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 13:31:28,911 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:31:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 13:31:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 13:31:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 13:31:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 13:31:29,012 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 13:31:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:29,012 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 13:31:29,012 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:31:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 13:31:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 13:31:29,012 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:29,012 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-07-25 13:31:29,013 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-07-25 13:31:29,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:29,967 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:29,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:29,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:31:29,967 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:31:29,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:31:29,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:31:29,968 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-07-25 13:31:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:31,060 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 13:31:31,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:31:31,061 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-07-25 13:31:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:31,061 INFO L225 Difference]: With dead ends: 104 [2018-07-25 13:31:31,061 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:31:31,062 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:31:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:31:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:31:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:31:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:31:31,168 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 13:31:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:31,168 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:31:31,168 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:31:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:31:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:31:31,169 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:31,169 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-07-25 13:31:31,169 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:31,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-07-25 13:31:31,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:32,333 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:32,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:32,334 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:31:32,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:31:32,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:31:32,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:31:32,335 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-07-25 13:31:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:33,430 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:31:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:31:33,430 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-07-25 13:31:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:33,431 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:31:33,431 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 13:31:33,432 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:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 13:31:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 13:31:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 13:31:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 13:31:33,525 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 13:31:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:33,525 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 13:31:33,525 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:31:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 13:31:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 13:31:33,525 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:33,526 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-07-25 13:31:33,526 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-07-25 13:31:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:34,552 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:34,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:34,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:31:34,553 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:31:34,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:31:34,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:31:34,554 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-07-25 13:31:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:35,713 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 13:31:35,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:31:35,713 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-07-25 13:31:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:35,714 INFO L225 Difference]: With dead ends: 106 [2018-07-25 13:31:35,714 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:31:35,714 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:31:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:31:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:31:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:31:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:31:35,804 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 13:31:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:35,804 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:31:35,804 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:31:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:31:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:31:35,805 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:35,805 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1] [2018-07-25 13:31:35,805 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833799, now seen corresponding path program 102 times [2018-07-25 13:31:35,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:36,690 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:36,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:36,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:31:36,691 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:31:36,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:31:36,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:31:36,692 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2018-07-25 13:31:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:37,751 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:31:37,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:31:37,751 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-07-25 13:31:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:37,752 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:31:37,752 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 13:31:37,753 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:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 13:31:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 13:31:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 13:31:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 13:31:37,843 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 13:31:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:37,843 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 13:31:37,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:31:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 13:31:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 13:31:37,844 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:37,844 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1] [2018-07-25 13:31:37,844 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076641, now seen corresponding path program 103 times [2018-07-25 13:31:37,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:38,777 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:38,777 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:38,778 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:31:38,778 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:31:38,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:31:38,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:31:38,779 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-07-25 13:31:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:39,934 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 13:31:39,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:31:39,935 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-07-25 13:31:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:39,935 INFO L225 Difference]: With dead ends: 108 [2018-07-25 13:31:39,936 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:31:39,936 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:31:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:31:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:31:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:31:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:31:40,034 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 13:31:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:40,035 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:31:40,035 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:31:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:31:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:31:40,035 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:40,035 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1] [2018-07-25 13:31:40,036 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash 748670151, now seen corresponding path program 104 times [2018-07-25 13:31:40,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:41,050 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:41,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:41,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:31:41,051 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:31:41,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:31:41,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:31:41,052 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2018-07-25 13:31:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:42,245 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:31:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:31:42,245 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2018-07-25 13:31:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:42,246 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:31:42,246 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 13:31:42,246 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:31:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 13:31:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 13:31:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 13:31:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 13:31:42,344 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 13:31:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:42,344 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 13:31:42,344 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:31:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 13:31:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 13:31:42,344 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:42,345 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1] [2018-07-25 13:31:42,345 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938145, now seen corresponding path program 105 times [2018-07-25 13:31:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:43,460 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:43,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:43,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:31:43,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:31:43,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:31:43,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:31:43,462 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-07-25 13:31:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:44,649 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 13:31:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:31:44,649 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-07-25 13:31:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:44,649 INFO L225 Difference]: With dead ends: 110 [2018-07-25 13:31:44,649 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:31:44,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:31:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:31:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:31:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:31:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:31:44,752 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 13:31:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:44,752 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:31:44,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:31:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:31:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:31:44,752 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:44,753 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1] [2018-07-25 13:31:44,753 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492409, now seen corresponding path program 106 times [2018-07-25 13:31:44,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:45,803 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:45,803 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:45,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:31:45,804 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:31:45,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:31:45,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:31:45,805 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2018-07-25 13:31:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:47,055 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:31:47,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:31:47,055 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2018-07-25 13:31:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:47,055 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:31:47,056 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 13:31:47,056 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:31:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 13:31:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 13:31:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 13:31:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 13:31:47,162 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 13:31:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:47,162 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 13:31:47,163 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:31:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 13:31:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 13:31:47,163 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:47,164 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1] [2018-07-25 13:31:47,164 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash -132755295, now seen corresponding path program 107 times [2018-07-25 13:31:47,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:48,293 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:48,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:48,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:31:48,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:31:48,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:31:48,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:31:48,295 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-07-25 13:31:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:49,535 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 13:31:49,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:31:49,536 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-07-25 13:31:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:49,536 INFO L225 Difference]: With dead ends: 112 [2018-07-25 13:31:49,536 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:31:49,537 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:31:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:31:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:31:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:31:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:31:49,642 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 13:31:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:49,642 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:31:49,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:31:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:31:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:31:49,642 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:49,643 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1] [2018-07-25 13:31:49,643 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash 179553095, now seen corresponding path program 108 times [2018-07-25 13:31:49,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:50,694 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:50,694 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:50,694 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:31:50,695 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:31:50,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:31:50,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:31:50,696 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2018-07-25 13:31:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:51,894 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:31:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:31:51,894 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2018-07-25 13:31:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:51,894 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:31:51,895 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 13:31:51,895 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:31:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 13:31:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 13:31:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 13:31:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 13:31:51,992 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 13:31:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:51,992 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 13:31:51,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:31:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 13:31:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 13:31:51,992 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:51,993 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1] [2018-07-25 13:31:51,993 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:51,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178593, now seen corresponding path program 109 times [2018-07-25 13:31:51,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:53,016 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:53,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:53,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:31:53,017 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:31:53,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:31:53,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:31:53,018 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-07-25 13:31:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:54,316 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 13:31:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:31:54,316 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-07-25 13:31:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:54,317 INFO L225 Difference]: With dead ends: 114 [2018-07-25 13:31:54,317 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:31:54,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:31:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:31:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:31:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:31:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:31:54,429 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 13:31:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:54,429 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:31:54,429 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:31:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:31:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:31:54,430 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:54,430 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1] [2018-07-25 13:31:54,430 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:54,430 INFO L82 PathProgramCache]: Analyzing trace with hash 751830663, now seen corresponding path program 110 times [2018-07-25 13:31:54,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:55,645 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:55,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:55,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:31:55,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:31:55,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:31:55,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:31:55,647 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2018-07-25 13:31:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:56,947 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:31:56,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:31:56,947 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2018-07-25 13:31:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:56,948 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:31:56,948 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 13:31:56,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:31:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 13:31:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 13:31:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 13:31:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 13:31:57,086 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 13:31:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:57,086 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 13:31:57,086 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:31:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 13:31:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 13:31:57,087 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:57,087 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1] [2018-07-25 13:31:57,087 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:57,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914017, now seen corresponding path program 111 times [2018-07-25 13:31:57,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:58,261 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:58,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:58,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:31:58,262 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:31:58,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:31:58,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:31:58,263 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-07-25 13:31:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:59,607 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 13:31:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:31:59,607 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-07-25 13:31:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:59,607 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:31:59,607 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:31:59,608 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:31:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:31:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:31:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:31:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:31:59,724 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 13:31:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:59,724 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:31:59,724 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:31:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:31:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:31:59,725 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:59,725 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1] [2018-07-25 13:31:59,725 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 954759623, now seen corresponding path program 112 times [2018-07-25 13:31:59,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:00,913 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:32:00,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:00,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:32:00,914 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:32:00,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:32:00,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:32:00,915 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2018-07-25 13:32:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:02,270 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:32:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:32:02,270 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2018-07-25 13:32:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:02,271 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:32:02,271 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 13:32:02,272 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:32:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 13:32:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 13:32:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 13:32:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 13:32:02,387 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 13:32:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:02,387 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 13:32:02,387 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:32:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 13:32:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 13:32:02,388 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:02,388 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1] [2018-07-25 13:32:02,388 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:02,388 INFO L82 PathProgramCache]: Analyzing trace with hash -467222815, now seen corresponding path program 113 times [2018-07-25 13:32:02,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:03,497 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:32:03,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:03,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:32:03,498 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:32:03,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:32:03,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:32:03,499 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-07-25 13:32:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:04,927 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 13:32:04,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:32:04,927 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-07-25 13:32:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:04,927 INFO L225 Difference]: With dead ends: 118 [2018-07-25 13:32:04,928 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:32:04,928 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:32:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:32:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:32:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:32:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:32:05,036 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 13:32:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:05,036 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:32:05,036 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:32:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:32:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:32:05,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:05,037 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1] [2018-07-25 13:32:05,037 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005433, now seen corresponding path program 114 times [2018-07-25 13:32:05,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:06,130 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:32:06,130 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:06,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:32:06,131 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:32:06,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:32:06,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:32:06,132 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2018-07-25 13:32:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:07,444 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:32:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:32:07,444 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-07-25 13:32:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:07,445 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:32:07,445 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 13:32:07,445 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:32:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 13:32:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 13:32:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 13:32:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 13:32:07,555 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 13:32:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:07,555 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 13:32:07,555 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:32:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 13:32:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 13:32:07,555 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:07,555 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1] [2018-07-25 13:32:07,556 INFO L415 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:07,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439073, now seen corresponding path program 115 times [2018-07-25 13:32:07,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:08,671 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:32:08,671 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:08,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:32:08,672 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:32:08,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:32:08,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:32:08,672 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-07-25 13:32:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:09,969 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 13:32:09,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:32:09,969 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-07-25 13:32:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:09,970 INFO L225 Difference]: With dead ends: 120 [2018-07-25 13:32:09,970 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:32:09,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:32:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:32:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:32:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:32:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:32:10,082 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 13:32:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:10,082 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:32:10,083 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:32:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:32:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:32:10,083 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:10,083 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1] [2018-07-25 13:32:10,083 INFO L415 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash 954069063, now seen corresponding path program 116 times [2018-07-25 13:32:10,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:11,252 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:32:11,252 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:11,252 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:32:11,252 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:32:11,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:32:11,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:32:11,254 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2018-07-25 13:32:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:12,636 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:32:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:32:12,637 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 118 [2018-07-25 13:32:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:12,637 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:32:12,637 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 13:32:12,638 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:32:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 13:32:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 13:32:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 13:32:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 13:32:12,813 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 13:32:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:12,814 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 13:32:12,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:32:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 13:32:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 13:32:12,814 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:12,814 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1] [2018-07-25 13:32:12,815 INFO L415 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash -488630175, now seen corresponding path program 117 times [2018-07-25 13:32:12,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:13,979 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:32:13,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:13,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:32:13,980 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:32:13,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:32:13,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:32:13,982 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-07-25 13:32:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:15,518 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 13:32:15,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:32:15,518 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-07-25 13:32:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:15,519 INFO L225 Difference]: With dead ends: 122 [2018-07-25 13:32:15,519 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:32:15,520 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:32:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:32:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:32:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:32:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:32:15,657 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 13:32:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:15,657 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:32:15,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:32:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:32:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:32:15,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:15,658 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1] [2018-07-25 13:32:15,658 INFO L415 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333703, now seen corresponding path program 118 times [2018-07-25 13:32:15,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:17,033 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:32:17,033 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:17,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:32:17,034 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:32:17,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:32:17,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:32:17,035 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 121 states. [2018-07-25 13:32:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:18,523 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:32:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:32:18,524 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 120 [2018-07-25 13:32:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:18,524 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:32:18,524 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 13:32:18,525 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:32:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 13:32:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 13:32:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 13:32:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 13:32:18,655 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 13:32:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:18,655 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 13:32:18,655 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:32:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 13:32:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 13:32:18,656 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:18,656 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1] [2018-07-25 13:32:18,656 INFO L415 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164703, now seen corresponding path program 119 times [2018-07-25 13:32:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:20,048 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:32:20,048 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:20,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:32:20,049 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:32:20,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:32:20,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:32:20,050 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-07-25 13:32:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:21,625 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 13:32:21,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:32:21,625 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-07-25 13:32:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:21,625 INFO L225 Difference]: With dead ends: 124 [2018-07-25 13:32:21,626 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:32:21,626 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:32:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:32:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:32:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:32:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:32:21,762 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 13:32:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:21,762 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:32:21,762 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:32:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:32:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:32:21,762 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:21,763 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1] [2018-07-25 13:32:21,763 INFO L415 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:21,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432889, now seen corresponding path program 120 times [2018-07-25 13:32:21,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:23,127 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:32:23,127 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:23,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:32:23,127 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:32:23,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:32:23,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:32:23,128 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 123 states. [2018-07-25 13:32:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:24,711 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:32:24,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:32:24,711 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 122 [2018-07-25 13:32:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:24,711 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:32:24,712 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 13:32:24,713 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:32:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 13:32:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 13:32:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 13:32:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 13:32:24,843 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 13:32:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:24,843 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 13:32:24,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:32:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 13:32:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 13:32:24,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:24,843 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1] [2018-07-25 13:32:24,844 INFO L415 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:24,844 INFO L82 PathProgramCache]: Analyzing trace with hash -900681247, now seen corresponding path program 121 times [2018-07-25 13:32:24,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:26,110 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:32:26,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:26,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:32:26,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:32:26,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:32:26,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:32:26,112 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-07-25 13:32:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:27,550 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 13:32:27,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:32:27,550 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-07-25 13:32:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:27,550 INFO L225 Difference]: With dead ends: 126 [2018-07-25 13:32:27,550 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:32:27,551 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:32:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:32:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:32:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:32:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:32:27,672 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 13:32:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:27,673 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:32:27,673 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:32:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:32:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:32:27,673 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:27,673 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1] [2018-07-25 13:32:27,673 INFO L415 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652359, now seen corresponding path program 122 times [2018-07-25 13:32:27,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:28,922 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:32:28,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:28,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:32:28,923 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:32:28,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:32:28,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:32:28,924 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 125 states. [2018-07-25 13:32:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:30,516 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:32:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:32:30,516 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 124 [2018-07-25 13:32:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:30,516 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:32:30,517 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 13:32:30,517 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:32:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 13:32:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 13:32:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 13:32:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 13:32:30,657 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 13:32:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:30,658 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 13:32:30,658 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:32:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 13:32:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 13:32:30,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:30,659 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1] [2018-07-25 13:32:30,659 INFO L415 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713633, now seen corresponding path program 123 times [2018-07-25 13:32:30,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:32,100 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:32:32,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:32,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:32:32,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:32:32,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:32:32,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:32:32,102 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-07-25 13:32:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:33,630 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 13:32:33,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:32:33,630 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-07-25 13:32:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:33,631 INFO L225 Difference]: With dead ends: 128 [2018-07-25 13:32:33,631 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:32:33,632 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:32:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:32:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:32:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:32:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:32:33,758 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 13:32:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:33,758 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:32:33,758 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:32:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:32:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:32:33,759 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:33,759 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1] [2018-07-25 13:32:33,759 INFO L415 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386873, now seen corresponding path program 124 times [2018-07-25 13:32:33,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:35,077 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:32:35,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:35,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:32:35,078 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:32:35,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:32:35,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:32:35,079 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 127 states. [2018-07-25 13:32:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:36,618 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:32:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:32:36,618 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 126 [2018-07-25 13:32:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:36,619 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:32:36,619 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 13:32:36,620 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:32:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 13:32:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 13:32:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 13:32:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 13:32:36,783 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 13:32:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:36,784 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 13:32:36,784 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:32:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 13:32:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 13:32:36,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:36,785 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1] [2018-07-25 13:32:36,785 INFO L415 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash -321352863, now seen corresponding path program 125 times [2018-07-25 13:32:36,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:38,142 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:32:38,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:38,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:32:38,143 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:32:38,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:32:38,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:32:38,144 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-07-25 13:32:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:39,710 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 13:32:39,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:32:39,710 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-07-25 13:32:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:39,711 INFO L225 Difference]: With dead ends: 130 [2018-07-25 13:32:39,711 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:32:39,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:32:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:32:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:32:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:32:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:32:39,872 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 13:32:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:39,872 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:32:39,872 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:32:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:32:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:32:39,873 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:39,873 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1] [2018-07-25 13:32:39,873 INFO L415 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:39,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004217, now seen corresponding path program 126 times [2018-07-25 13:32:39,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:41,422 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:41,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:41,423 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:32:41,423 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:32:41,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:32:41,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:32:41,424 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 129 states. [2018-07-25 13:32:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:43,133 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:32:43,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:32:43,133 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 128 [2018-07-25 13:32:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:43,134 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:32:43,134 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 13:32:43,134 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:32:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 13:32:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 13:32:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 13:32:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 13:32:43,277 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 13:32:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:43,277 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 13:32:43,278 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:32:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 13:32:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 13:32:43,278 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:43,278 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1] [2018-07-25 13:32:43,279 INFO L415 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash 417542177, now seen corresponding path program 127 times [2018-07-25 13:32:43,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:44,770 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:44,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:44,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:32:44,771 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:32:44,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:32:44,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:32:44,772 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-07-25 13:32:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:46,574 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 13:32:46,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:32:46,575 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-07-25 13:32:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:46,576 INFO L225 Difference]: With dead ends: 132 [2018-07-25 13:32:46,576 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:32:46,577 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:32:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:32:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:32:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:32:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:32:46,723 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 13:32:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:46,724 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:32:46,724 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:32:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:32:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:32:46,724 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:46,725 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1] [2018-07-25 13:32:46,725 INFO L415 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:46,725 INFO L82 PathProgramCache]: Analyzing trace with hash 58905543, now seen corresponding path program 128 times [2018-07-25 13:32:46,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:48,199 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:48,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:48,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:32:48,200 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:32:48,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:32:48,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:32:48,201 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 131 states. [2018-07-25 13:32:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:49,964 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:32:49,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:32:49,965 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 130 [2018-07-25 13:32:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:49,965 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:32:49,965 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 13:32:49,967 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:32:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 13:32:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 13:32:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 13:32:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 13:32:50,119 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 13:32:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:50,119 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 13:32:50,119 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:32:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 13:32:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 13:32:50,120 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:50,120 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1] [2018-07-25 13:32:50,120 INFO L415 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:50,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071777, now seen corresponding path program 129 times [2018-07-25 13:32:50,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:51,649 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:51,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:51,649 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:32:51,649 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:32:51,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:32:51,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:32:51,650 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-07-25 13:32:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:53,431 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 13:32:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:32:53,431 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-07-25 13:32:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:53,431 INFO L225 Difference]: With dead ends: 134 [2018-07-25 13:32:53,432 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:32:53,432 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:32:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:32:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:32:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:32:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:32:53,586 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 13:32:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:53,586 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:32:53,586 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:32:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:32:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:32:53,586 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:53,587 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1] [2018-07-25 13:32:53,587 INFO L415 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash 773650183, now seen corresponding path program 130 times [2018-07-25 13:32:53,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:55,205 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:55,205 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:55,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:32:55,205 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:32:55,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:32:55,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:32:55,206 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 133 states. [2018-07-25 13:32:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:56,968 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:32:56,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:32:56,968 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 132 [2018-07-25 13:32:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:56,969 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:32:56,969 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 13:32:56,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:32:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 13:32:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 13:32:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 13:32:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 13:32:57,128 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 13:32:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:57,128 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 13:32:57,128 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:32:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 13:32:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 13:32:57,129 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:57,129 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1] [2018-07-25 13:32:57,129 INFO L415 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648159, now seen corresponding path program 131 times [2018-07-25 13:32:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:58,740 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:58,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:58,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:32:58,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:32:58,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:32:58,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:32:58,742 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-07-25 13:33:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:00,604 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 13:33:00,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:33:00,604 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-07-25 13:33:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:00,605 INFO L225 Difference]: With dead ends: 136 [2018-07-25 13:33:00,605 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:33:00,605 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:33:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:33:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:33:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:33:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:33:00,760 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 13:33:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:00,760 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:33:00,760 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:33:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:33:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:33:00,761 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:00,761 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1] [2018-07-25 13:33:00,761 INFO L415 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:00,761 INFO L82 PathProgramCache]: Analyzing trace with hash 448481863, now seen corresponding path program 132 times [2018-07-25 13:33:00,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:02,288 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:33:02,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:02,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:33:02,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:33:02,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:33:02,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:33:02,290 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 135 states. [2018-07-25 13:33:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:04,084 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:33:04,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:33:04,084 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 134 [2018-07-25 13:33:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:04,084 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:33:04,084 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 13:33:04,085 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:33:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 13:33:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 13:33:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 13:33:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 13:33:04,322 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 13:33:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:04,322 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 13:33:04,322 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:33:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 13:33:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 13:33:04,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:04,322 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1] [2018-07-25 13:33:04,323 INFO L415 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035809, now seen corresponding path program 133 times [2018-07-25 13:33:04,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:05,787 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:33:05,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:05,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:33:05,788 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:33:05,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:33:05,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:33:05,789 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-07-25 13:33:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:07,657 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 13:33:07,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:33:07,658 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-07-25 13:33:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:07,658 INFO L225 Difference]: With dead ends: 138 [2018-07-25 13:33:07,658 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:33:07,659 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:33:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:33:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:33:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:33:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:33:07,823 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 13:33:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:07,823 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:33:07,823 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:33:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:33:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:33:07,824 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:07,824 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1] [2018-07-25 13:33:07,824 INFO L415 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1494338951, now seen corresponding path program 134 times [2018-07-25 13:33:07,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:09,539 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:33:09,539 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:09,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:33:09,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:33:09,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:33:09,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:33:09,541 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 137 states. [2018-07-25 13:33:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,447 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:33:11,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:33:11,447 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 136 [2018-07-25 13:33:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,447 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:33:11,447 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 13:33:11,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:33:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 13:33:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 13:33:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 13:33:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 13:33:11,599 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 13:33:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,599 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 13:33:11,599 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:33:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 13:33:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 13:33:11,600 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,600 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1] [2018-07-25 13:33:11,600 INFO L415 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash -920132831, now seen corresponding path program 135 times [2018-07-25 13:33:11,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:13,198 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:33:13,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:13,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:33:13,199 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:33:13,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:33:13,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:33:13,200 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-07-25 13:33:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:14,997 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 13:33:14,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:33:14,998 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-07-25 13:33:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:14,998 INFO L225 Difference]: With dead ends: 140 [2018-07-25 13:33:14,998 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:33:14,999 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:33:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:33:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:33:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:33:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:33:15,151 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 13:33:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:15,152 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:33:15,152 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:33:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:33:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:33:15,152 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:15,152 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1] [2018-07-25 13:33:15,152 INFO L415 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:15,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653255, now seen corresponding path program 136 times [2018-07-25 13:33:15,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:16,722 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:33:16,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:16,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:33:16,722 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:33:16,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:33:16,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:33:16,723 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 139 states. [2018-07-25 13:33:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:18,548 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:33:18,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:33:18,548 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 138 [2018-07-25 13:33:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:18,549 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:33:18,549 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 13:33:18,550 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:33:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 13:33:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 13:33:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 13:33:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 13:33:18,703 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 13:33:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:18,704 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 13:33:18,704 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:33:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 13:33:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 13:33:18,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:18,704 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1] [2018-07-25 13:33:18,704 INFO L415 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:18,705 INFO L82 PathProgramCache]: Analyzing trace with hash 515610593, now seen corresponding path program 137 times [2018-07-25 13:33:18,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:20,344 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:33:20,345 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:20,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:33:20,345 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:33:20,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:33:20,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:33:20,346 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-07-25 13:33:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,211 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 13:33:22,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:33:22,212 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-07-25 13:33:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,212 INFO L225 Difference]: With dead ends: 142 [2018-07-25 13:33:22,212 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:33:22,213 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:33:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:33:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:33:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:33:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:33:22,369 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 13:33:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,369 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:33:22,369 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:33:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:33:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:33:22,370 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,370 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1] [2018-07-25 13:33:22,370 INFO L415 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940857, now seen corresponding path program 138 times [2018-07-25 13:33:22,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,992 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:33:23,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:33:23,993 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:33:23,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:33:23,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:33:23,994 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 141 states. [2018-07-25 13:33:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:25,895 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:33:25,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:33:25,895 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-07-25 13:33:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:25,896 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:33:25,896 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 13:33:25,896 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:33:25,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 13:33:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 13:33:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 13:33:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 13:33:26,055 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 13:33:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:26,055 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 13:33:26,055 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:33:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 13:33:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 13:33:26,055 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:26,055 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1] [2018-07-25 13:33:26,055 INFO L415 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539041, now seen corresponding path program 139 times [2018-07-25 13:33:26,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:27,804 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:33:27,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:27,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:33:27,805 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:33:27,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:33:27,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:33:27,806 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-07-25 13:33:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:29,949 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 13:33:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:33:29,949 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-07-25 13:33:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:29,949 INFO L225 Difference]: With dead ends: 144 [2018-07-25 13:33:29,950 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:33:29,950 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:33:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:33:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:33:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:33:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:33:30,150 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 13:33:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:30,151 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:33:30,151 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:33:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:33:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:33:30,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:30,151 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1] [2018-07-25 13:33:30,151 INFO L415 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1752069959, now seen corresponding path program 140 times [2018-07-25 13:33:30,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:32,072 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:33:32,073 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:32,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:33:32,073 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:33:32,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:33:32,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:33:32,074 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 143 states. [2018-07-25 13:33:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:34,119 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:33:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:33:34,119 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 142 [2018-07-25 13:33:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:34,119 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:33:34,120 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 13:33:34,120 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:33:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 13:33:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 13:33:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 13:33:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 13:33:34,297 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 13:33:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:34,298 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 13:33:34,298 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:33:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 13:33:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 13:33:34,298 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:34,298 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1] [2018-07-25 13:33:34,298 INFO L415 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406175, now seen corresponding path program 141 times [2018-07-25 13:33:34,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:36,280 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:33:36,281 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:36,281 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:33:36,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:33:36,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:33:36,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:33:36,282 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-07-25 13:33:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:38,361 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 13:33:38,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:33:38,362 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-07-25 13:33:38,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:38,362 INFO L225 Difference]: With dead ends: 146 [2018-07-25 13:33:38,362 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:33:38,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:33:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:33:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:33:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:33:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:33:38,532 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 13:33:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:38,532 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:33:38,532 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:33:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:33:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:33:38,532 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:38,532 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1] [2018-07-25 13:33:38,533 INFO L415 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:38,533 INFO L82 PathProgramCache]: Analyzing trace with hash 112048775, now seen corresponding path program 142 times [2018-07-25 13:33:38,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:40,321 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:33:40,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:40,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:33:40,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:33:40,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:33:40,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:33:40,323 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 145 states. [2018-07-25 13:33:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:42,434 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:33:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:33:42,434 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 144 [2018-07-25 13:33:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:42,434 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:33:42,434 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 13:33:42,435 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:33:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 13:33:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 13:33:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 13:33:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 13:33:42,605 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 13:33:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:42,605 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 13:33:42,605 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:33:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 13:33:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 13:33:42,606 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:42,606 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1] [2018-07-25 13:33:42,606 INFO L415 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash -821455327, now seen corresponding path program 143 times [2018-07-25 13:33:42,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:44,422 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:33:44,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:44,423 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:33:44,423 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:33:44,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:33:44,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:33:44,425 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-07-25 13:33:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:46,620 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 13:33:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:33:46,620 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-07-25 13:33:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:46,620 INFO L225 Difference]: With dead ends: 148 [2018-07-25 13:33:46,620 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:33:46,621 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:33:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:33:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:33:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:33:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:33:46,808 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 13:33:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:46,808 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:33:46,808 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:33:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:33:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:33:46,809 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:46,809 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1] [2018-07-25 13:33:46,809 INFO L415 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash 304688583, now seen corresponding path program 144 times [2018-07-25 13:33:46,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:48,863 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:33:48,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:48,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:33:48,863 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:33:48,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:33:48,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:33:48,865 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 147 states. [2018-07-25 13:33:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:51,162 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:33:51,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:33:51,162 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 146 [2018-07-25 13:33:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:51,163 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:33:51,163 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 13:33:51,164 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:33:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 13:33:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 13:33:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 13:33:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 13:33:51,345 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 13:33:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:51,345 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 13:33:51,346 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:33:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 13:33:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 13:33:51,346 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:51,346 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1] [2018-07-25 13:33:51,346 INFO L415 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:51,347 INFO L82 PathProgramCache]: Analyzing trace with hash 855411425, now seen corresponding path program 145 times [2018-07-25 13:33:51,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:53,251 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:33:53,252 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:53,252 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:33:53,252 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:33:53,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:33:53,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:33:53,253 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-07-25 13:33:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:55,571 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 13:33:55,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:33:55,572 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-07-25 13:33:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:55,572 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:33:55,572 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:33:55,573 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:33:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:33:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:33:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:33:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:33:55,750 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 13:33:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:55,750 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:33:55,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:33:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:33:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:33:55,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:55,751 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1] [2018-07-25 13:33:55,751 INFO L415 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 747950343, now seen corresponding path program 146 times [2018-07-25 13:33:55,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:57,682 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:33:57,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:57,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:33:57,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:33:57,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:33:57,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:33:57,684 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 149 states. [2018-07-25 13:33:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:59,923 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:33:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:33:59,924 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 148 [2018-07-25 13:33:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:59,924 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:33:59,924 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 13:33:59,925 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:33:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 13:34:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 13:34:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 13:34:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 13:34:00,112 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 13:34:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:00,113 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 13:34:00,113 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:34:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 13:34:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 13:34:00,113 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:00,114 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1] [2018-07-25 13:34:00,114 INFO L415 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:00,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624097, now seen corresponding path program 147 times [2018-07-25 13:34:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:02,065 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:34:02,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:02,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:34:02,066 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:34:02,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:34:02,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:34:02,067 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-07-25 13:34:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:04,312 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 13:34:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:34:04,313 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-07-25 13:34:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:04,313 INFO L225 Difference]: With dead ends: 152 [2018-07-25 13:34:04,313 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:34:04,314 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:34:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:34:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:34:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:34:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:34:04,510 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 13:34:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:04,510 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:34:04,510 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:34:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:34:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:34:04,510 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:04,511 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1] [2018-07-25 13:34:04,511 INFO L415 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739399, now seen corresponding path program 148 times [2018-07-25 13:34:04,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:06,698 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:34:06,698 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:06,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:34:06,699 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:34:06,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:34:06,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:34:06,700 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 151 states. [2018-07-25 13:34:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:09,128 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:34:09,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:34:09,128 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 150 [2018-07-25 13:34:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:09,129 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:34:09,129 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 13:34:09,129 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:34:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 13:34:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 13:34:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 13:34:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 13:34:09,329 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 13:34:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:09,330 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 13:34:09,330 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:34:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 13:34:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 13:34:09,330 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:09,330 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1] [2018-07-25 13:34:09,330 INFO L415 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash -101718943, now seen corresponding path program 149 times [2018-07-25 13:34:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:11,554 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:34:11,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:11,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:34:11,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:34:11,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:34:11,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:34:11,556 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-07-25 13:34:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:14,043 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 13:34:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:34:14,043 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-07-25 13:34:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:14,043 INFO L225 Difference]: With dead ends: 154 [2018-07-25 13:34:14,044 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:34:14,045 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:34:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:34:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:34:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:34:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:34:14,247 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 13:34:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:14,247 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:34:14,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:34:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:34:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:34:14,248 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:14,248 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1] [2018-07-25 13:34:14,248 INFO L415 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680007, now seen corresponding path program 150 times [2018-07-25 13:34:14,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:16,556 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:34:16,556 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:16,556 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:34:16,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:34:16,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:34:16,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:34:16,558 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 153 states. Received shutdown request... [2018-07-25 13:34:18,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:34:18,221 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:34:18,228 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:34:18,228 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:34:18 BoogieIcfgContainer [2018-07-25 13:34:18,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:34:18,229 INFO L168 Benchmark]: Toolchain (without parser) took 256829.72 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 327.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-07-25 13:34:18,231 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:18,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.07 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:18,232 INFO L168 Benchmark]: Boogie Preprocessor took 20.91 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:18,232 INFO L168 Benchmark]: RCFGBuilder took 225.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:34:18,233 INFO L168 Benchmark]: TraceAbstraction took 256532.75 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 317.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-07-25 13:34:18,240 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.21 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 45.07 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 20.91 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 225.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256532.75 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 317.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (153states) and interpolant automaton (currently 100 states, 153 states before enhancement), while ReachableStatesComputation was computing reachable states (98 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 256.4s OverallTime, 151 OverallIterations, 150 TraceHistogramMax, 127.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 301 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 1173724 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 88.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11476 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 101.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=150, 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: 11.3s AutomataMinimizationTime, 150 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 107.6s InterpolantComputationTime, 11627 NumberOfCodeBlocks, 11627 NumberOfCodeBlocksAsserted, 151 NumberOfCheckSat, 11476 ConstructedInterpolants, 0 QuantifiedInterpolants, 20336954 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/573800 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/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-34-18-257.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-34-18-257.csv Completed graceful shutdown