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/Luxembourg.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:33:20,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:33:20,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:33:20,593 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:33:20,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:33:20,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:33:20,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:33:20,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:33:20,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:33:20,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:33:20,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:33:20,612 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:33:20,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:33:20,614 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:33:20,615 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:33:20,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:33:20,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:33:20,621 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:33:20,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:33:20,628 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:33:20,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:33:20,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:33:20,635 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:33:20,637 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:33:20,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:33:20,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:33:20,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:33:20,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:33:20,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:33:20,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:33:20,643 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:33:20,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:33:20,644 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:33:20,644 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:33:20,646 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:33:20,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:33:20,647 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:33:20,662 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:33:20,662 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:33:20,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:33:20,664 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:33:20,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:33:20,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:33:20,665 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:33:20,665 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:33:20,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:33:20,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:33:20,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:33:20,761 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:33:20,762 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:33:20,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg.bpl [2018-07-25 13:33:20,763 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg.bpl' [2018-07-25 13:33:20,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:33:20,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:33:20,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:33:20,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:33:20,808 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:33:20,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,843 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:33:20,843 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:33:20,843 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:33:20,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:33:20,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:33:20,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:33:20,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:33:20,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:33:20,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:33:20,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:33:20,867 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:33:20,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/1) ... [2018-07-25 13:33:20,946 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 13:33:20,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 13:33:20,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 13:33:21,064 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:33:21,065 INFO L202 PluginConnector]: Adding new model Luxembourg.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:33:21 BoogieIcfgContainer [2018-07-25 13:33:21,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:33:21,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:33:21,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:33:21,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:33:21,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:33:20" (1/2) ... [2018-07-25 13:33:21,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91f8654 and model type Luxembourg.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:33:21, skipping insertion in model container [2018-07-25 13:33:21,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:33:21" (2/2) ... [2018-07-25 13:33:21,075 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg.bpl [2018-07-25 13:33:21,085 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:33:21,094 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:33:21,143 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:33:21,144 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:33:21,145 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:33:21,145 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:33:21,145 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:33:21,145 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:33:21,146 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:33:21,146 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:33:21,146 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:33:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:33:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:33:21,171 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,172 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:33:21,173 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-07-25 13:33:21,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,274 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:33:21,279 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:33:21,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:33:21,284 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:33:21,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:33:21,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:33:21,307 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:33:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:21,346 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-25 13:33:21,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:33:21,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:33:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:21,366 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:33:21,366 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:33:21,371 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:33:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:33:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:33:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:33:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:33:21,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:33:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:21,405 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:33:21,405 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:33:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:33:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:33:21,406 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,406 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:33:21,407 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-07-25 13:33:21,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,435 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:33:21,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:21,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:33:21,441 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:33:21,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:33:21,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:33:21,443 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 13:33:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:21,470 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:33:21,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:33:21,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:33:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:21,472 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:33:21,473 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:33:21,474 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:33:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:33:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:33:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:33:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:33:21,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:33:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:21,478 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:33:21,478 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:33:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:33:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:33:21,480 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,481 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:33:21,481 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,481 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-07-25 13:33:21,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,513 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:33:21,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:21,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:33:21,514 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:33:21,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:33:21,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:33:21,515 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 13:33:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:21,527 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:33:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:33:21,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:33:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:21,528 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:33:21,528 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:33:21,531 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:33:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:33:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:33:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:33:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:33:21,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:33:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:21,537 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:33:21,537 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:33:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:33:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:33:21,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,538 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:33:21,538 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-07-25 13:33:21,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,571 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:33:21,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:21,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:33:21,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:33:21,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:33:21,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:33:21,573 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:33:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:21,586 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:33:21,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:33:21,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:33:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:21,587 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:33:21,588 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:33:21,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:33:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:33:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:33:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:33:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:33:21,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:33:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:21,592 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:33:21,592 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:33:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:33:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:33:21,593 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,593 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:33:21,594 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-07-25 13:33:21,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,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:33:21,640 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:21,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:33:21,641 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:33:21,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:33:21,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:33:21,642 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:33:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:21,656 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:33:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:33:21,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:33:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:21,658 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:33:21,658 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:33:21,659 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:33:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:33:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:33:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:33:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:33:21,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:33:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:21,670 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:33:21,670 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:33:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:33:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:33:21,671 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,671 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:33:21,671 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-07-25 13:33:21,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,718 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:33:21,718 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:21,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:33:21,719 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:33:21,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:33:21,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:33:21,720 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 13:33:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:21,738 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:33:21,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:33:21,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:33:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:21,739 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:33:21,739 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:33:21,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:33:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:33:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:33:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:33:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:33:21,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:33:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:21,744 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:33:21,744 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:33:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:33:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:33:21,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,745 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:33:21,745 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-07-25 13:33:21,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,845 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:33:21,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:21,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:33:21,846 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:33:21,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:33:21,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:33:21,848 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 13:33:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:21,866 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:33:21,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:33:21,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:33:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:21,867 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:33:21,867 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:33:21,868 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:33:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:33:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:33:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:33:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:33:21,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:33:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:21,874 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:33:21,874 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:33:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:33:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:33:21,875 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,875 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:33:21,875 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-07-25 13:33:21,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:21,944 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:33:21,945 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:21,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:33:21,945 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:33:21,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:33:21,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:33:21,946 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 13:33:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:21,959 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:33:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:33:21,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 13:33:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:21,961 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:33:21,961 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:33:21,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:33:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:33:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:33:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:33:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:33:21,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:33:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:21,966 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:33:21,966 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:33:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:33:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:33:21,966 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:21,967 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:33:21,967 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-07-25 13:33:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,028 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:33:22,029 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:33:22,029 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:33:22,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:33:22,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:33:22,030 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 13:33:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,043 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:33:22,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:33:22,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 13:33:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,044 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:33:22,044 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:33:22,045 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:33:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:33:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:33:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:33:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:33:22,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:33:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,049 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:33:22,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:33:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:33:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:33:22,050 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,050 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:33:22,051 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,051 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-07-25 13:33:22,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,132 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:33:22,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:33:22,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:33:22,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:33:22,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:33:22,138 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 13:33:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,168 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:33:22,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:33:22,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 13:33:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,169 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:33:22,170 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:33:22,173 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:33:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:33:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:33:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:33:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:33:22,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:33:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,182 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:33:22,182 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:33:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:33:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:33:22,183 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,183 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 13:33:22,184 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-07-25 13:33:22,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,253 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:33:22,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:33:22,254 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:33:22,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:33:22,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:33:22,255 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 13:33:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,266 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:33:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:33:22,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 13:33:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,268 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:33:22,268 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:33:22,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:33:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:33:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:33:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:33:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:33:22,272 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:33:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,273 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:33:22,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:33:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:33:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:33:22,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,274 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 13:33:22,274 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-07-25 13:33:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,321 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:33:22,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:33:22,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:33:22,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:33:22,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:33:22,324 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 13:33:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,357 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:33:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:33:22,357 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 13:33:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,359 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:33:22,359 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:33:22,360 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:33:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:33:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:33:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:33:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:33:22,369 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:33:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,370 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:33:22,370 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:33:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:33:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:33:22,371 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,371 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 13:33:22,371 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-07-25 13:33:22,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,442 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:33:22,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:33:22,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:33:22,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:33:22,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:33:22,449 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 13:33:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,474 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:33:22,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:33:22,476 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 13:33:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,477 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:33:22,479 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:33:22,480 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:33:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:33:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:33:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:33:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:33:22,489 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:33:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,490 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:33:22,490 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:33:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:33:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:33:22,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,491 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 13:33:22,492 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-07-25 13:33:22,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,567 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:33:22,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:33:22,568 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:33:22,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:33:22,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:33:22,571 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 13:33:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,594 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:33:22,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:33:22,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 13:33:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,596 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:33:22,596 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:33:22,596 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:33:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:33:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:33:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:33:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:33:22,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:33:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,603 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:33:22,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:33:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:33:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:33:22,604 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,604 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 13:33:22,605 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,605 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-07-25 13:33:22,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,656 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:33:22,657 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,657 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:33:22,658 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:33:22,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:33:22,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:33:22,661 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 13:33:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,675 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:33:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:33:22,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 13:33:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,677 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:33:22,677 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:33:22,679 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:33:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:33:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:33:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:33:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:33:22,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:33:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,685 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:33:22,685 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:33:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:33:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:33:22,688 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,688 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 13:33:22,688 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-07-25 13:33:22,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,761 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:33:22,762 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:33:22,762 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:33:22,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:33:22,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:33:22,764 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 13:33:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,777 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:33:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:33:22,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 13:33:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,778 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:33:22,778 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:33:22,779 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:33:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:33:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:33:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:33:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:33:22,783 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:33:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,783 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:33:22,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:33:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:33:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:33:22,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,785 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 13:33:22,785 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-07-25 13:33:22,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,838 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:33:22,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,838 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:33:22,839 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:33:22,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:33:22,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:33:22,840 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 13:33:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,859 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:33:22,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:33:22,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 13:33:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,863 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:33:22,863 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:33:22,864 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:33:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:33:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:33:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:33:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:33:22,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 13:33:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,871 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:33:22,871 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:33:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:33:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:33:22,872 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,873 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 13:33:22,873 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-07-25 13:33:22,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,946 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:33:22,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:33:22,947 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:33:22,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:33:22,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:33:22,948 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 13:33:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,974 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:33:22,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:33:22,974 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 13:33:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,975 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:33:22,975 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 13:33:22,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:33:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 13:33:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 13:33:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:33:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:33:22,981 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 13:33:22,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,982 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:33:22,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:33:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:33:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:33:22,987 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,987 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 13:33:22,988 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-07-25 13:33:22,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,071 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:33:23,072 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,072 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:33:23,073 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:33:23,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:33:23,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:33:23,078 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 13:33:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:23,094 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:33:23,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:33:23,094 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 13:33:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:23,095 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:33:23,095 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:33:23,096 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:33:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:33:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:33:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:33:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:33:23,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 13:33:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:23,107 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:33:23,107 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:33:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:33:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:33:23,108 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:23,108 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 13:33:23,109 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:23,109 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-07-25 13:33:23,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,204 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:33:23,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:33:23,205 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:33:23,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:33:23,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:33:23,207 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 13:33:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:23,222 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:33:23,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:33:23,223 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 13:33:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:23,223 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:33:23,224 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:33:23,225 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:33:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:33:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 13:33:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:33:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:33:23,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 13:33:23,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:23,231 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:33:23,231 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:33:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:33:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:33:23,232 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:23,234 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 13:33:23,234 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-07-25 13:33:23,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,325 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:33:23,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:33:23,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:33:23,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:33:23,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:33:23,329 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 13:33:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:23,346 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:33:23,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:33:23,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 13:33:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:23,347 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:33:23,347 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:33:23,348 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:33:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:33:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:33:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:33:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:33:23,355 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 13:33:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:23,355 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:33:23,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:33:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:33:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:33:23,356 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:23,356 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 13:33:23,357 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:23,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-07-25 13:33:23,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,452 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:33:23,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:33:23,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:33:23,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:33:23,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:33:23,454 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 13:33:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:23,476 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:33:23,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:33:23,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 13:33:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:23,479 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:33:23,480 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 13:33:23,480 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:33:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 13:33:23,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 13:33:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:33:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:33:23,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 13:33:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:23,490 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:33:23,490 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:33:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:33:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:33:23,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:23,491 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 13:33:23,492 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:23,492 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-07-25 13:33:23,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,596 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:33:23,596 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:33:23,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:33:23,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:33:23,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:33:23,598 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 13:33:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:23,612 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:33:23,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:33:23,612 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 13:33:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:23,613 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:33:23,613 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:33:23,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:33:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:33:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:33:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:33:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:33:23,618 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 13:33:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:23,618 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:33:23,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:33:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:33:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:33:23,619 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:23,619 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 13:33:23,619 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-07-25 13:33:23,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,710 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:33:23,711 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,711 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:33:23,711 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:33:23,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:33:23,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:33:23,713 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 13:33:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:23,733 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:33:23,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:33:23,733 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 13:33:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:23,734 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:33:23,734 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:33:23,735 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:33:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:33:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:33:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:33:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:33:23,745 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 13:33:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:23,746 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:33:23,746 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:33:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:33:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:33:23,749 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:23,750 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 13:33:23,750 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-07-25 13:33:23,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,850 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:33:23,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:33:23,851 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:33:23,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:33:23,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:33:23,852 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 13:33:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:23,873 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:33:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:33:23,873 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 13:33:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:23,874 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:33:23,874 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:33:23,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:33:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:33:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:33:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:33:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:33:23,880 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 13:33:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:23,881 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:33:23,881 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:33:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:33:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:33:23,882 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:23,882 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 13:33:23,882 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:23,882 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-07-25 13:33:23,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:24,003 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:33:24,003 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:24,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:33:24,004 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:33:24,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:33:24,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:33:24,005 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 13:33:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:24,025 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:33:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:33:24,028 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 13:33:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:24,029 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:33:24,029 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:33:24,030 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:33:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:33:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 13:33:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:33:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:33:24,033 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 13:33:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:24,034 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:33:24,034 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:33:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:33:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:33:24,035 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:24,035 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 13:33:24,035 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:24,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-07-25 13:33:24,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:24,154 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:33:24,155 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:24,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:33:24,156 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:33:24,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:33:24,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:33:24,157 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 13:33:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:24,171 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:33:24,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:33:24,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 13:33:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:24,172 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:33:24,172 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:33:24,173 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:33:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:33:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:33:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:33:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:33:24,176 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 13:33:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:24,177 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:33:24,177 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:33:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:33:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:33:24,178 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:24,178 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 13:33:24,178 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-07-25 13:33:24,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:24,301 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:33:24,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:24,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:33:24,302 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:33:24,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:33:24,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:33:24,303 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 13:33:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:24,319 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:33:24,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:33:24,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 13:33:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:24,320 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:33:24,320 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:33:24,321 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:33:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:33:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:33:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:33:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:33:24,325 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 13:33:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:24,325 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:33:24,326 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:33:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:33:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:33:24,326 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:24,326 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 13:33:24,327 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-07-25 13:33:24,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:24,446 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:33:24,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:24,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:33:24,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:33:24,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:33:24,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:33:24,448 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 13:33:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:24,461 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:33:24,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:33:24,462 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 13:33:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:24,462 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:33:24,462 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:33:24,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:33:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:33:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:33:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:33:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:33:24,467 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 13:33:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:24,467 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:33:24,468 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:33:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:33:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:33:24,468 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:24,468 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 13:33:24,469 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:24,469 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-07-25 13:33:24,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:24,587 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:33:24,588 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:24,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:33:24,588 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:33:24,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:33:24,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:33:24,590 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 13:33:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:24,607 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:33:24,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:33:24,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 13:33:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:24,608 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:33:24,608 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:33:24,609 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:33:24,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:33:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 13:33:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:33:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:33:24,612 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 13:33:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:24,613 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:33:24,613 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:33:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:33:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:33:24,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:24,614 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 13:33:24,614 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-07-25 13:33:24,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:24,740 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:33:24,741 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:24,741 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:33:24,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:33:24,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:33:24,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:33:24,743 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 13:33:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:24,760 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:33:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:33:24,760 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 13:33:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:24,761 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:33:24,761 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:33:24,762 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:33:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:33:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:33:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:33:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:33:24,766 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 13:33:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:24,766 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:33:24,766 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:33:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:33:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:33:24,767 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:24,767 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 13:33:24,767 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-07-25 13:33:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:24,907 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:33:24,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:24,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:33:24,908 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:33:24,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:33:24,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:33:24,909 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 13:33:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:24,925 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:33:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:33:24,925 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 13:33:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:24,926 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:33:24,926 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:33:24,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:33:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:33:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 13:33:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:33:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:33:24,932 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 13:33:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:24,932 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:33:24,932 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:33:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:33:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:33:24,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:24,933 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 13:33:24,933 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-07-25 13:33:24,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:25,088 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:33:25,089 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:25,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:33:25,089 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:33:25,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:33:25,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:33:25,093 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 13:33:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:25,130 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:33:25,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:33:25,130 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 13:33:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:25,131 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:33:25,131 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:33:25,132 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:33:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:33:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:33:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:33:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:33:25,138 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 13:33:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:25,139 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:33:25,139 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:33:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:33:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:33:25,139 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:25,139 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 13:33:25,140 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:25,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-07-25 13:33:25,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:25,265 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:33:25,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:25,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:33:25,266 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:33:25,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:33:25,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:33:25,267 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 13:33:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:25,282 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:33:25,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:33:25,282 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 13:33:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:25,283 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:33:25,283 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:33:25,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:33:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:33:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:33:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:33:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:33:25,287 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 13:33:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:25,287 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:33:25,287 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:33:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:33:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:33:25,288 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:25,288 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 13:33:25,288 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-07-25 13:33:25,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:25,421 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:33:25,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:25,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:33:25,422 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:33:25,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:33:25,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:33:25,423 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 13:33:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:25,439 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:33:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:33:25,439 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 13:33:25,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:25,440 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:33:25,440 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:33:25,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:33:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:33:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:33:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:33:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:33:25,444 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 13:33:25,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:25,444 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:33:25,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:33:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:33:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:33:25,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:25,445 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 13:33:25,445 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-07-25 13:33:25,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:25,595 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:33:25,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:25,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:33:25,596 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:33:25,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:33:25,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:33:25,598 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 13:33:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:25,616 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:33:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:33:25,616 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 13:33:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:25,617 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:33:25,617 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 13:33:25,618 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:33:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 13:33:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 13:33:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:33:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:33:25,621 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 13:33:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:25,621 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:33:25,621 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:33:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:33:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:33:25,622 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:25,622 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 13:33:25,622 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-07-25 13:33:25,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:25,760 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:33:25,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:25,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:33:25,760 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:33:25,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:33:25,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:33:25,762 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 13:33:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:25,778 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:33:25,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:33:25,779 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 13:33:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:25,779 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:33:25,779 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:33:25,780 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:33:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:33:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:33:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:33:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:33:25,783 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 13:33:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:25,783 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:33:25,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:33:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:33:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:33:25,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:25,784 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 13:33:25,784 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-07-25 13:33:25,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:25,920 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:33:25,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:25,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:33:25,921 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:33:25,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:33:25,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:33:25,923 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 13:33:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:25,945 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:33:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:33:25,945 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 13:33:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:25,946 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:33:25,946 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 13:33:25,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:33:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 13:33:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 13:33:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:33:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:33:25,951 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 13:33:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:25,955 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:33:25,955 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:33:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:33:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:33:25,956 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:25,956 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 13:33:25,956 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-07-25 13:33:25,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:26,106 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:33:26,107 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:26,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:33:26,107 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:33:26,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:33:26,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:33:26,109 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 13:33:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:26,131 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:33:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:33:26,131 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 13:33:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:26,132 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:33:26,132 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:33:26,134 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:33:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:33:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:33:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:33:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:33:26,137 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 13:33:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:26,137 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:33:26,137 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:33:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:33:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:33:26,138 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:26,138 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 13:33:26,138 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-07-25 13:33:26,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:26,290 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:33:26,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:26,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:33:26,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:33:26,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:33:26,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:33:26,293 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 13:33:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:26,311 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:33:26,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:33:26,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 13:33:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:26,312 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:33:26,312 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:33:26,314 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:33:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:33:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 13:33:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:33:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:33:26,316 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 13:33:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:26,316 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:33:26,316 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:33:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:33:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:33:26,317 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:26,317 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 13:33:26,317 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:26,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-07-25 13:33:26,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:26,475 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:33:26,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:26,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:33:26,476 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:33:26,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:33:26,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:33:26,477 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 13:33:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:26,500 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:33:26,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:33:26,500 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 13:33:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:26,501 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:33:26,501 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:33:26,502 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:33:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:33:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:33:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:33:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:33:26,504 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 13:33:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:26,505 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:33:26,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:33:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:33:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:33:26,505 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:26,506 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 13:33:26,506 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-07-25 13:33:26,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:26,667 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:33:26,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:26,668 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:33:26,668 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:33:26,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:33:26,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:33:26,670 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 13:33:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:26,689 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 13:33:26,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:33:26,689 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 13:33:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:26,689 INFO L225 Difference]: With dead ends: 48 [2018-07-25 13:33:26,690 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 13:33:26,691 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:33:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 13:33:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 13:33:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:33:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:33:26,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 13:33:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:26,693 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:33:26,694 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:33:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:33:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:33:26,694 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:26,694 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 13:33:26,694 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-07-25 13:33:26,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:26,863 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:33:26,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:26,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:33:26,863 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:33:26,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:33:26,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:33:26,865 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 13:33:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:26,885 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:33:26,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:33:26,885 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 13:33:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:26,886 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:33:26,886 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:33:26,887 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:33:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:33:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:33:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:33:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:33:26,890 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 13:33:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:26,890 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:33:26,891 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:33:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:33:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:33:26,892 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:26,892 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 13:33:26,892 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-07-25 13:33:26,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:27,075 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:33:27,076 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:27,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:33:27,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:33:27,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:33:27,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:33:27,079 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 13:33:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:27,108 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:33:27,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:33:27,108 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 13:33:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:27,109 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:33:27,109 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 13:33:27,111 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:33:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 13:33:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 13:33:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:33:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 13:33:27,114 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 13:33:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:27,114 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 13:33:27,115 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:33:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 13:33:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 13:33:27,115 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:27,115 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 13:33:27,115 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-07-25 13:33:27,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:27,319 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:33:27,319 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:27,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:33:27,320 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:33:27,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:33:27,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:33:27,322 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 13:33:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:27,349 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:33:27,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:33:27,350 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 13:33:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:27,350 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:33:27,351 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:33:27,352 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:33:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:33:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:33:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:33:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:33:27,355 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 13:33:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:27,355 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:33:27,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:33:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:33:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:33:27,356 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:27,356 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 13:33:27,356 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-07-25 13:33:27,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:27,564 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:33:27,564 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:27,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:33:27,565 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:33:27,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:33:27,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:33:27,566 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 13:33:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:27,589 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 13:33:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:33:27,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 13:33:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:27,590 INFO L225 Difference]: With dead ends: 52 [2018-07-25 13:33:27,590 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 13:33:27,591 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:33:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 13:33:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 13:33:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 13:33:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 13:33:27,594 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 13:33:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:27,594 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 13:33:27,594 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:33:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 13:33:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:33:27,595 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:27,595 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 13:33:27,596 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-07-25 13:33:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:27,801 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:33:27,802 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:27,802 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:33:27,802 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:33:27,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:33:27,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:33:27,804 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 13:33:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:27,825 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:33:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:33:27,825 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 13:33:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:27,826 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:33:27,826 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:33:27,826 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:33:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:33:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:33:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:33:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:33:27,829 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 13:33:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:27,829 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:33:27,829 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:33:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:33:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:33:27,830 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:27,830 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 13:33:27,830 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-07-25 13:33:27,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:27,988 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:33:27,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:27,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:33:27,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:33:27,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:33:27,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:33:27,991 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 13:33:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:28,011 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 13:33:28,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:33:28,011 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 13:33:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:28,012 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:33:28,012 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 13:33:28,013 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:33:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 13:33:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 13:33:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 13:33:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 13:33:28,017 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 13:33:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:28,018 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 13:33:28,018 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:33:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 13:33:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 13:33:28,019 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:28,019 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 13:33:28,020 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-07-25 13:33:28,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:28,183 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:33:28,183 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:28,183 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:33:28,184 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:33:28,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:33:28,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:33:28,185 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 13:33:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:28,212 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:33:28,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:33:28,212 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 13:33:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:28,213 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:33:28,213 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:33:28,214 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:33:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:33:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:33:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:33:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:33:28,217 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 13:33:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:28,217 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:33:28,218 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:33:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:33:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:33:28,218 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:28,218 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 13:33:28,219 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-07-25 13:33:28,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:28,418 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:33:28,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:28,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:33:28,418 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:33:28,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:33:28,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:33:28,420 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 13:33:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:28,452 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 13:33:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:33:28,452 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 13:33:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:28,453 INFO L225 Difference]: With dead ends: 56 [2018-07-25 13:33:28,453 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 13:33:28,454 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:33:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 13:33:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 13:33:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 13:33:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 13:33:28,457 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 13:33:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:28,457 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 13:33:28,457 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:33:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 13:33:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 13:33:28,458 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:28,458 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 13:33:28,458 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-07-25 13:33:28,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:28,666 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:33:28,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:28,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:33:28,667 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:33:28,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:33:28,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:33:28,669 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 13:33:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:28,704 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:33:28,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:33:28,705 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 13:33:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:28,705 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:33:28,705 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:33:28,707 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:33:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:33:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:33:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:33:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:33:28,714 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 13:33:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:28,714 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:33:28,714 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:33:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:33:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:33:28,715 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:28,715 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 13:33:28,715 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-07-25 13:33:28,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:28,923 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:33:28,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:28,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:33:28,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:33:28,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:33:28,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:33:28,926 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 13:33:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:28,952 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 13:33:28,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:33:28,952 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 13:33:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:28,953 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:33:28,953 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 13:33:28,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:33:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 13:33:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 13:33:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:33:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:33:28,956 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 13:33:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:28,957 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:33:28,957 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:33:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:33:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:33:28,957 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:28,958 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 13:33:28,958 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:28,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-07-25 13:33:28,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:29,159 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:33:29,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:29,160 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:33:29,160 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:33:29,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:33:29,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:33:29,162 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 13:33:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:29,194 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:33:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:33:29,194 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 13:33:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:29,195 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:33:29,195 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:33:29,196 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:33:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:33:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:33:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:33:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:33:29,199 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 13:33:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:29,199 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:33:29,199 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:33:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:33:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:33:29,200 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:29,200 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 13:33:29,200 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-07-25 13:33:29,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:29,415 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:33:29,415 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:29,415 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:33:29,416 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:33:29,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:33:29,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:33:29,417 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 13:33:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:29,452 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:33:29,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:33:29,452 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 13:33:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:29,453 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:33:29,453 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 13:33:29,454 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:33:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 13:33:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 13:33:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 13:33:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 13:33:29,457 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 13:33:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:29,457 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 13:33:29,458 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:33:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 13:33:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:33:29,458 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:29,458 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 13:33:29,459 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:29,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-07-25 13:33:29,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:29,690 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:33:29,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:29,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:33:29,691 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:33:29,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:33:29,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:33:29,693 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 13:33:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:29,732 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:33:29,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:33:29,733 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 13:33:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:29,733 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:33:29,733 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:33:29,735 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:33:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:33:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:33:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:33:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:33:29,738 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 13:33:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:29,738 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:33:29,738 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:33:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:33:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:33:29,739 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:29,739 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 13:33:29,739 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-07-25 13:33:29,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:30,020 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:33:30,020 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:30,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:33:30,021 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:33:30,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:33:30,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:33:30,023 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 13:33:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:30,053 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 13:33:30,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:33:30,054 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 13:33:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:30,055 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:33:30,055 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:33:30,057 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:33:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:33:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 13:33:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:33:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 13:33:30,062 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 13:33:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:30,062 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 13:33:30,063 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:33:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 13:33:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 13:33:30,063 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:30,064 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 13:33:30,064 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:30,064 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-07-25 13:33:30,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:30,385 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:33:30,385 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:30,385 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:33:30,386 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:33:30,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:33:30,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:33:30,388 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 13:33:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:30,433 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:33:30,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:33:30,433 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 13:33:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:30,434 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:33:30,434 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:33:30,435 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:33:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:33:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:33:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:33:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:33:30,438 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 13:33:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:30,438 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:33:30,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:33:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:33:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:33:30,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:30,439 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 13:33:30,440 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:30,440 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-07-25 13:33:30,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:30,679 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:33:30,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:30,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:33:30,680 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:33:30,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:33:30,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:33:30,682 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 13:33:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:30,727 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 13:33:30,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:33:30,727 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 13:33:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:30,728 INFO L225 Difference]: With dead ends: 64 [2018-07-25 13:33:30,728 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 13:33:30,730 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:33:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 13:33:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 13:33:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 13:33:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 13:33:30,733 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 13:33:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:30,733 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 13:33:30,733 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:33:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 13:33:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 13:33:30,734 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:30,735 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 13:33:30,735 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-07-25 13:33:30,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:30,973 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:33:30,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:30,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:33:30,974 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:33:30,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:33:30,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:33:30,976 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 13:33:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:31,017 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:33:31,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:33:31,018 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 13:33:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:31,018 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:33:31,019 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:33:31,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:33:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:33:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:33:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:33:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:33:31,025 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 13:33:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:31,026 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:33:31,026 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:33:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:33:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:33:31,026 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:31,027 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 13:33:31,027 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-07-25 13:33:31,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:31,280 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:33:31,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:31,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:33:31,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:33:31,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:33:31,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:33:31,283 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 13:33:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:31,330 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 13:33:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:33:31,330 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 13:33:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:31,331 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:33:31,331 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 13:33:31,332 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:33:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 13:33:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 13:33:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 13:33:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 13:33:31,336 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 13:33:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:31,337 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 13:33:31,337 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:33:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 13:33:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 13:33:31,337 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:31,338 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 13:33:31,338 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-07-25 13:33:31,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:31,583 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:33:31,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:31,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:33:31,584 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:33:31,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:33:31,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:33:31,586 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 13:33:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:31,628 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:33:31,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:33:31,628 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 13:33:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:31,629 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:33:31,629 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:33:31,631 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:33:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:33:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:33:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:33:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:33:31,634 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 13:33:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:31,635 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:33:31,635 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:33:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:33:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:33:31,635 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:31,636 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 13:33:31,636 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-07-25 13:33:31,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:31,870 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:33:31,870 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:31,870 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:33:31,871 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:33:31,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:33:31,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:33:31,873 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 13:33:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:31,908 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 13:33:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:33:31,908 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 13:33:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:31,909 INFO L225 Difference]: With dead ends: 68 [2018-07-25 13:33:31,909 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 13:33:31,910 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:33:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 13:33:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 13:33:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:33:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:33:31,914 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 13:33:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:31,914 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:33:31,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:33:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:33:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:33:31,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:31,915 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 13:33:31,915 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:31,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-07-25 13:33:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:32,141 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:33:32,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:32,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:33:32,142 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:33:32,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:33:32,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:33:32,144 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 13:33:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:32,186 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:33:32,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:33:32,186 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 13:33:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:32,187 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:33:32,187 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:33:32,188 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:33:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:33:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:33:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:33:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:33:32,191 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 13:33:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:32,191 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:33:32,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:33:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:33:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:33:32,192 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:32,192 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 13:33:32,192 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:32,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-07-25 13:33:32,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:32,428 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:33:32,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:32,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:33:32,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:33:32,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:33:32,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:33:32,433 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 13:33:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:32,470 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:33:32,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:33:32,470 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 13:33:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:32,474 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:33:32,474 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 13:33:32,475 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:33:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 13:33:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 13:33:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 13:33:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 13:33:32,480 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 13:33:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:32,480 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 13:33:32,480 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:33:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 13:33:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:33:32,481 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:32,481 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 13:33:32,482 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-07-25 13:33:32,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:32,721 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:33:32,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:32,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:33:32,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:33:32,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:33:32,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:33:32,724 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 13:33:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:32,774 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:33:32,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:33:32,774 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 13:33:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:32,775 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:33:32,775 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:33:32,776 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:33:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:33:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:33:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:33:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:33:32,780 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 13:33:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:32,780 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:33:32,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:33:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:33:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:33:32,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:32,784 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 13:33:32,785 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-07-25 13:33:32,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:33,089 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:33:33,089 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:33,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:33:33,090 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:33:33,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:33:33,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:33:33,092 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 13:33:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:33,147 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 13:33:33,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:33:33,148 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 13:33:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:33,149 INFO L225 Difference]: With dead ends: 72 [2018-07-25 13:33:33,149 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 13:33:33,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:33:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 13:33:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 13:33:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:33:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 13:33:33,154 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 13:33:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:33,154 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 13:33:33,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:33:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 13:33:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:33:33,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:33,156 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 13:33:33,156 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-07-25 13:33:33,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:33,436 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:33:33,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:33,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:33:33,437 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:33:33,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:33:33,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:33:33,438 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 13:33:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:33,479 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:33:33,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:33:33,480 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 13:33:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:33,481 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:33:33,481 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:33:33,482 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:33:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:33:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:33:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:33:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:33:33,485 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 13:33:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:33,485 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:33:33,485 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:33:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:33:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:33:33,486 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:33,486 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 13:33:33,486 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:33,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-07-25 13:33:33,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:33,716 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:33:33,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:33,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:33:33,717 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:33:33,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:33:33,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:33:33,719 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 13:33:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:33,751 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 13:33:33,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:33:33,751 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 13:33:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:33,752 INFO L225 Difference]: With dead ends: 74 [2018-07-25 13:33:33,752 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 13:33:33,753 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:33:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 13:33:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 13:33:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:33:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 13:33:33,756 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 13:33:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:33,757 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 13:33:33,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:33:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 13:33:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 13:33:33,757 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:33,758 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 13:33:33,758 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:33,758 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-07-25 13:33:33,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:33,999 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:33:33,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:34,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:33:34,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:33:34,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:33:34,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:33:34,002 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 13:33:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:34,053 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:33:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:33:34,053 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 13:33:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:34,054 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:33:34,054 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:33:34,056 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:33:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:33:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:33:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:33:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:33:34,059 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 13:33:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:34,059 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:33:34,059 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:33:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:33:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:33:34,060 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:34,060 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 13:33:34,061 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-07-25 13:33:34,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:34,315 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:33:34,315 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:34,315 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:33:34,315 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:33:34,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:33:34,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:33:34,317 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 13:33:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:34,378 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 13:33:34,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:33:34,378 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 13:33:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:34,379 INFO L225 Difference]: With dead ends: 76 [2018-07-25 13:33:34,379 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 13:33:34,380 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:33:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 13:33:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 13:33:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:33:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 13:33:34,383 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 13:33:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:34,383 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 13:33:34,383 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:33:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 13:33:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:33:34,384 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:34,384 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 13:33:34,385 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-07-25 13:33:34,385 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:34,643 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:33:34,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:34,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:33:34,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:33:34,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:33:34,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:33:34,649 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 13:33:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:34,705 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:33:34,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:33:34,706 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 13:33:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:34,707 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:33:34,707 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:33:34,708 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:33:34,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:33:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:33:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:33:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:33:34,712 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 13:33:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:34,713 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:33:34,713 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:33:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:33:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:33:34,714 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:34,714 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 13:33:34,714 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-07-25 13:33:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:34,966 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:33:34,970 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:34,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:33:34,970 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:33:34,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:33:34,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:33:34,972 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 13:33:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:35,033 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 13:33:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:33:35,033 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 13:33:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:35,034 INFO L225 Difference]: With dead ends: 78 [2018-07-25 13:33:35,034 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:33:35,035 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:33:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:33:35,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 13:33:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:33:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:33:35,038 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 13:33:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:35,038 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:33:35,038 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:33:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:33:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:33:35,039 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:35,039 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 13:33:35,040 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-07-25 13:33:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:35,288 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:33:35,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:35,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:33:35,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:33:35,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:33:35,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:33:35,291 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 13:33:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:35,353 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:33:35,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:33:35,354 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 13:33:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:35,354 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:33:35,355 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:33:35,355 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:33:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:33:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:33:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:33:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:33:35,359 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 13:33:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:35,359 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:33:35,359 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:33:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:33:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:33:35,360 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:35,360 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 13:33:35,360 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-07-25 13:33:35,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:35,629 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:33:35,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:35,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:33:35,630 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:33:35,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:33:35,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:33:35,632 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 13:33:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:35,689 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:33:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:33:35,689 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 13:33:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:35,690 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:33:35,690 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:33:35,691 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:33:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:33:35,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 13:33:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:33:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 13:33:35,694 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 13:33:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:35,694 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 13:33:35,694 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:33:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 13:33:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 13:33:35,695 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:35,695 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 13:33:35,695 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-07-25 13:33:35,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:35,929 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:33:35,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:35,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:33:35,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:33:35,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:33:35,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:33:35,932 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 13:33:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:35,995 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:33:35,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:33:35,995 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 13:33:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:35,996 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:33:35,996 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:33:35,997 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:33:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:33:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:33:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:33:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:33:36,000 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 13:33:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:36,000 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:33:36,000 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:33:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:33:36,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:33:36,001 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:36,001 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 13:33:36,002 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:36,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-07-25 13:33:36,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:36,231 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:33:36,231 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:36,231 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:33:36,231 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:33:36,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:33:36,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:33:36,233 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 13:33:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:36,297 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 13:33:36,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:33:36,297 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 13:33:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:36,298 INFO L225 Difference]: With dead ends: 82 [2018-07-25 13:33:36,298 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 13:33:36,299 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:33:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 13:33:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 13:33:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:33:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 13:33:36,302 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 13:33:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:36,303 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 13:33:36,303 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:33:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 13:33:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:33:36,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:36,304 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 13:33:36,304 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:36,304 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-07-25 13:33:36,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:36,536 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:33:36,536 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:36,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:33:36,536 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:33:36,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:33:36,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:33:36,538 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 13:33:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:36,580 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:33:36,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:33:36,580 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 13:33:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:36,581 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:33:36,581 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:33:36,583 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:33:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:33:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:33:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:33:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:33:36,586 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 13:33:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:36,587 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:33:36,587 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:33:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:33:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:33:36,587 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:36,588 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 13:33:36,588 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-07-25 13:33:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:36,823 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:33:36,824 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:36,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:33:36,824 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:33:36,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:33:36,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:33:36,826 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 13:33:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:36,864 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 13:33:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:33:36,865 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 13:33:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:36,865 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:33:36,866 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:33:36,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:33:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:33:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 13:33:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 13:33:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 13:33:36,870 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 13:33:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:36,870 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 13:33:36,870 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:33:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 13:33:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 13:33:36,871 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:36,871 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 13:33:36,871 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:36,871 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-07-25 13:33:36,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:37,142 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:33:37,143 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:37,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:33:37,143 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:33:37,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:33:37,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:33:37,145 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 13:33:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:37,208 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:33:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:33:37,209 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 13:33:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:37,209 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:33:37,209 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:33:37,210 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:33:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:33:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:33:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:33:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:33:37,213 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 13:33:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:37,214 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:33:37,214 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:33:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:33:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:33:37,215 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:37,215 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 13:33:37,215 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-07-25 13:33:37,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:37,461 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:33:37,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:37,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:33:37,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:33:37,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:33:37,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:33:37,463 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 13:33:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:37,538 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 13:33:37,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:33:37,539 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 13:33:37,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:37,540 INFO L225 Difference]: With dead ends: 86 [2018-07-25 13:33:37,540 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 13:33:37,541 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:33:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 13:33:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 13:33:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:33:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 13:33:37,544 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 13:33:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:37,544 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 13:33:37,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:33:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 13:33:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 13:33:37,545 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:37,545 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 13:33:37,546 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-07-25 13:33:37,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:37,891 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:33:37,892 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:37,892 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:33:37,892 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:33:37,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:33:37,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:33:37,894 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 13:33:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:37,936 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:33:37,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:33:37,937 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 13:33:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:37,937 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:33:37,938 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:33:37,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:33:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:33:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:33:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:33:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:33:37,942 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 13:33:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:37,943 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:33:37,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:33:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:33:37,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:33:37,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:37,944 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 13:33:37,944 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-07-25 13:33:37,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:38,285 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:33:38,286 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:38,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:33:38,286 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:33:38,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:33:38,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:33:38,288 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 13:33:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:38,349 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 13:33:38,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:33:38,350 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 13:33:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:38,351 INFO L225 Difference]: With dead ends: 88 [2018-07-25 13:33:38,351 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 13:33:38,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:33:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 13:33:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 13:33:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:33:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:33:38,354 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 13:33:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:38,355 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:33:38,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:33:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:33:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:33:38,355 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:38,356 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 13:33:38,356 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-07-25 13:33:38,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:38,643 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:33:38,644 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:38,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:33:38,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:33:38,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:33:38,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:33:38,645 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 13:33:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:38,724 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:33:38,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:33:38,724 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 13:33:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:38,725 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:33:38,725 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:33:38,726 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:33:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:33:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:33:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:33:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:33:38,729 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 13:33:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:38,729 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:33:38,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:33:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:33:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:33:38,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:38,730 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 13:33:38,730 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-07-25 13:33:38,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:38,959 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:33:38,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:38,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:33:38,960 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:33:38,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:33:38,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:33:38,962 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 13:33:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:39,002 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:33:39,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:33:39,003 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 13:33:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:39,004 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:33:39,004 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 13:33:39,004 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:33:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 13:33:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 13:33:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 13:33:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 13:33:39,008 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 13:33:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:39,008 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 13:33:39,008 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:33:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 13:33:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 13:33:39,009 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:39,009 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 13:33:39,009 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:39,010 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-07-25 13:33:39,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:39,274 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:33:39,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:39,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:33:39,275 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:33:39,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:33:39,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:33:39,276 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 13:33:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:39,367 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:33:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:33:39,368 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 13:33:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:39,369 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:33:39,369 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:33:39,369 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:33:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:33:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:33:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:33:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:33:39,372 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 13:33:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:39,373 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:33:39,373 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:33:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:33:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:33:39,373 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:39,374 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 13:33:39,374 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-07-25 13:33:39,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:39,689 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:33:39,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:39,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:33:39,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:33:39,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:33:39,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:33:39,692 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-25 13:33:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:39,744 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 13:33:39,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:33:39,745 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-25 13:33:39,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:39,746 INFO L225 Difference]: With dead ends: 92 [2018-07-25 13:33:39,746 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 13:33:39,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:33:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 13:33:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 13:33:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 13:33:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 13:33:39,751 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 13:33:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:39,751 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 13:33:39,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:33:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 13:33:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 13:33:39,752 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:39,752 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-25 13:33:39,753 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:39,753 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-07-25 13:33:39,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:40,110 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:33:40,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:40,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:33:40,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:33:40,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:33:40,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:33:40,113 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-25 13:33:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:40,224 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:33:40,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:33:40,224 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-25 13:33:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:40,225 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:33:40,225 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:33:40,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:33:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:33:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:33:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:33:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:33:40,229 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 13:33:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:40,229 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:33:40,229 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:33:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:33:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:33:40,230 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:40,230 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-25 13:33:40,230 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-07-25 13:33:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:40,571 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:33:40,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:40,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:33:40,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:33:40,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:33:40,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:33:40,573 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-25 13:33:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:40,612 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 13:33:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:33:40,613 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-25 13:33:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:40,614 INFO L225 Difference]: With dead ends: 94 [2018-07-25 13:33:40,614 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 13:33:40,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:33:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 13:33:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 13:33:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 13:33:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 13:33:40,617 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 13:33:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:40,618 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 13:33:40,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:33:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 13:33:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 13:33:40,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:40,619 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-25 13:33:40,619 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-07-25 13:33:40,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:40,928 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:33:40,928 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:40,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:33:40,929 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:33:40,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:33:40,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:33:40,931 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-25 13:33:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:41,033 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:33:41,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:33:41,034 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-25 13:33:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:41,035 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:33:41,035 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:33:41,035 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:33:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:33:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:33:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:33:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:33:41,039 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 13:33:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:41,040 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:33:41,040 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:33:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:33:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:33:41,041 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:41,041 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-25 13:33:41,041 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-07-25 13:33:41,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:41,308 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:33:41,309 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:41,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:33:41,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:33:41,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:33:41,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:33:41,311 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-25 13:33:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:41,393 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 13:33:41,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:33:41,393 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-25 13:33:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:41,394 INFO L225 Difference]: With dead ends: 96 [2018-07-25 13:33:41,394 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 13:33:41,395 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:33:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 13:33:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 13:33:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 13:33:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 13:33:41,398 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 13:33:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:41,399 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 13:33:41,399 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:33:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 13:33:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 13:33:41,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:41,400 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-25 13:33:41,400 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:41,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-07-25 13:33:41,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:41,753 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:33:41,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:41,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:33:41,754 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:33:41,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:33:41,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:33:41,756 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-25 13:33:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:41,815 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:33:41,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:33:41,816 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-25 13:33:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:41,817 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:33:41,817 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:33:41,818 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:33:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:33:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:33:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:33:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:33:41,827 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 13:33:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:41,827 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:33:41,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:33:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:33:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:33:41,828 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:41,828 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-25 13:33:41,831 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-07-25 13:33:41,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:42,110 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:33:42,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:42,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:33:42,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:33:42,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:33:42,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:33:42,113 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-25 13:33:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:42,175 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 13:33:42,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:33:42,175 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-25 13:33:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:42,176 INFO L225 Difference]: With dead ends: 98 [2018-07-25 13:33:42,176 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 13:33:42,177 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:33:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 13:33:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 13:33:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:33:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 13:33:42,180 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 13:33:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:42,180 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 13:33:42,180 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:33:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 13:33:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:33:42,181 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:42,181 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-25 13:33:42,181 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-07-25 13:33:42,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:42,445 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:33:42,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:42,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:33:42,446 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:33:42,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:33:42,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:33:42,447 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-25 13:33:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:42,530 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:33:42,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:33:42,531 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-25 13:33:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:42,531 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:33:42,531 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:33:42,532 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:33:42,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:33:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:33:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:33:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:33:42,535 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 13:33:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:42,535 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:33:42,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:33:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:33:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:33:42,536 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:42,536 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-25 13:33:42,536 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:42,536 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-07-25 13:33:42,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:42,850 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:33:42,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:42,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:33:42,851 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:33:42,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:33:42,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:33:42,853 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-25 13:33:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:42,937 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 13:33:42,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:33:42,937 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-25 13:33:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:42,938 INFO L225 Difference]: With dead ends: 100 [2018-07-25 13:33:42,938 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 13:33:42,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:33:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 13:33:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 13:33:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 13:33:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 13:33:42,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 13:33:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:42,942 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 13:33:42,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:33:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 13:33:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 13:33:42,943 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:42,943 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-25 13:33:42,944 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-07-25 13:33:42,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:43,302 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:33:43,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:43,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:33:43,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:33:43,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:33:43,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:33:43,304 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-07-25 13:33:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:43,356 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:33:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:33:43,357 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-25 13:33:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:43,357 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:33:43,358 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:33:43,358 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:33:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:33:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:33:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:33:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:33:43,361 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 13:33:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:43,361 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:33:43,361 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:33:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:33:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:33:43,361 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:43,361 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-25 13:33:43,362 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:43,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-07-25 13:33:43,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:43,629 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:33:43,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:43,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:33:43,630 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:33:43,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:33:43,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:33:43,632 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-07-25 13:33:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:43,675 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 13:33:43,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:33:43,676 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-25 13:33:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:43,676 INFO L225 Difference]: With dead ends: 102 [2018-07-25 13:33:43,676 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 13:33:43,677 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:33:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 13:33:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 13:33:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:33:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 13:33:43,680 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 13:33:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:43,680 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 13:33:43,680 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:33:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 13:33:43,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 13:33:43,681 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:43,681 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-25 13:33:43,681 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:43,682 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-07-25 13:33:43,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:43,935 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:33:43,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:43,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:33:43,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:33:43,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:33:43,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:33:43,937 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-07-25 13:33:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:43,985 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:33:43,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:33:43,985 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-25 13:33:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:43,986 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:33:43,986 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:33:43,987 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:33:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:33:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:33:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:33:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:33:43,990 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 13:33:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:43,991 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:33:43,991 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:33:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:33:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:33:43,991 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:43,991 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-25 13:33:43,992 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:43,992 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-07-25 13:33:43,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:44,259 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:33:44,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:44,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:33:44,260 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:33:44,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:33:44,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:33:44,261 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-07-25 13:33:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:44,315 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 13:33:44,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:33:44,316 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-25 13:33:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:44,316 INFO L225 Difference]: With dead ends: 104 [2018-07-25 13:33:44,316 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 13:33:44,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:33:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 13:33:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 13:33:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 13:33:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 13:33:44,320 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 13:33:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:44,321 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 13:33:44,321 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:33:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 13:33:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 13:33:44,321 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:44,321 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-25 13:33:44,322 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-07-25 13:33:44,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:44,596 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:33:44,597 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:44,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:33:44,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:33:44,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:33:44,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:33:44,599 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-07-25 13:33:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:44,654 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:33:44,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:33:44,654 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-25 13:33:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:44,655 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:33:44,655 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:33:44,656 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:33:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:33:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:33:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:33:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:33:44,658 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 13:33:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:44,658 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:33:44,658 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:33:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:33:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:33:44,659 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:44,659 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-25 13:33:44,659 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:44,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-07-25 13:33:44,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:44,955 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:33:44,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:44,955 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:33:44,955 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:33:44,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:33:44,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:33:44,957 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-07-25 13:33:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:45,016 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 13:33:45,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:33:45,016 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-25 13:33:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:45,017 INFO L225 Difference]: With dead ends: 106 [2018-07-25 13:33:45,017 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 13:33:45,018 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:33:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 13:33:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 13:33:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 13:33:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 13:33:45,021 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 13:33:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:45,022 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 13:33:45,022 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:33:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 13:33:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 13:33:45,023 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:45,023 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-25 13:33:45,023 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-07-25 13:33:45,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:45,347 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:33:45,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:45,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:33:45,348 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:33:45,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:33:45,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:33:45,349 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-07-25 13:33:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:45,417 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:33:45,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:33:45,418 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-25 13:33:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:45,419 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:33:45,419 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:33:45,420 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:33:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:33:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:33:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:33:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:33:45,423 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 13:33:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:45,423 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:33:45,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:33:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:33:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:33:45,424 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:45,424 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-07-25 13:33:45,425 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:45,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-07-25 13:33:45,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:45,736 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:33:45,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:45,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:33:45,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:33:45,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:33:45,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:33:45,738 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-07-25 13:33:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:45,819 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 13:33:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:33:45,819 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-07-25 13:33:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:45,820 INFO L225 Difference]: With dead ends: 108 [2018-07-25 13:33:45,820 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 13:33:45,821 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:33:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 13:33:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 13:33:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 13:33:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 13:33:45,824 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 13:33:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:45,824 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 13:33:45,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:33:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 13:33:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 13:33:45,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:45,825 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-07-25 13:33:45,825 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:45,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-07-25 13:33:45,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:46,111 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:33:46,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:46,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:33:46,112 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:33:46,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:33:46,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:33:46,113 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-07-25 13:33:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:46,219 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:33:46,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:33:46,219 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-07-25 13:33:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:46,220 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:33:46,220 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:33:46,220 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:33:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:33:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:33:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:33:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:33:46,224 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 13:33:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:46,224 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:33:46,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:33:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:33:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:33:46,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:46,225 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-07-25 13:33:46,225 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-07-25 13:33:46,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:46,558 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:33:46,558 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:46,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:33:46,558 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:33:46,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:33:46,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:33:46,560 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-07-25 13:33:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:46,675 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 13:33:46,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:33:46,675 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-07-25 13:33:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:46,676 INFO L225 Difference]: With dead ends: 110 [2018-07-25 13:33:46,676 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 13:33:46,677 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:33:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 13:33:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 13:33:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 13:33:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 13:33:46,680 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 13:33:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:46,680 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 13:33:46,680 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:33:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 13:33:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 13:33:46,681 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:46,681 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-07-25 13:33:46,681 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-07-25 13:33:46,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:47,066 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:33:47,067 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:47,067 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:33:47,067 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:33:47,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:33:47,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:33:47,069 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-07-25 13:33:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:47,138 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:33:47,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:33:47,139 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-07-25 13:33:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:47,139 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:33:47,139 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:33:47,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:33:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:33:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:33:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:33:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:33:47,144 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 13:33:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:47,144 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:33:47,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:33:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:33:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:33:47,145 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:47,145 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-07-25 13:33:47,145 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-07-25 13:33:47,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:47,483 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:33:47,484 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:47,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:33:47,484 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:33:47,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:33:47,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:33:47,486 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-07-25 13:33:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:47,560 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 13:33:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:33:47,560 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-07-25 13:33:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:47,561 INFO L225 Difference]: With dead ends: 112 [2018-07-25 13:33:47,561 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 13:33:47,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:33:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 13:33:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 13:33:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 13:33:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 13:33:47,566 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 13:33:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:47,566 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 13:33:47,566 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:33:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 13:33:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 13:33:47,567 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:47,567 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-07-25 13:33:47,568 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-07-25 13:33:47,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:47,978 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:33:47,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:47,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:33:47,979 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:33:47,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:33:47,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:33:47,981 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-07-25 13:33:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:48,097 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:33:48,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:33:48,098 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-07-25 13:33:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:48,098 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:33:48,098 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:33:48,099 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:33:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:33:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:33:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:33:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:33:48,104 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 13:33:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:48,104 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:33:48,105 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:33:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:33:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:33:48,105 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:48,105 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-07-25 13:33:48,106 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:48,106 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-07-25 13:33:48,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:48,431 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:33:48,432 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:48,432 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:33:48,432 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:33:48,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:33:48,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:33:48,434 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-07-25 13:33:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:48,555 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 13:33:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:33:48,556 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-07-25 13:33:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:48,556 INFO L225 Difference]: With dead ends: 114 [2018-07-25 13:33:48,556 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 13:33:48,557 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:33:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 13:33:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 13:33:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 13:33:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 13:33:48,560 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 13:33:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:48,560 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 13:33:48,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:33:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 13:33:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 13:33:48,561 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:48,561 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-07-25 13:33:48,562 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-07-25 13:33:48,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:48,965 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:33:48,965 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:48,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:33:48,966 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:33:48,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:33:48,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:33:48,968 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-07-25 13:33:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:49,074 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:33:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:33:49,074 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-07-25 13:33:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:49,075 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:33:49,075 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:33:49,076 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:33:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:33:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:33:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:33:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:33:49,079 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 13:33:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:49,079 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:33:49,079 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:33:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:33:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:33:49,080 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:49,080 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-07-25 13:33:49,080 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:49,080 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-07-25 13:33:49,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:49,443 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:33:49,443 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:49,443 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:33:49,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:33:49,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:33:49,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:33:49,446 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-07-25 13:33:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:49,652 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 13:33:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:33:49,652 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-07-25 13:33:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:49,653 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:33:49,653 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 13:33:49,654 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:33:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 13:33:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 13:33:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 13:33:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 13:33:49,659 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 13:33:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:49,659 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 13:33:49,659 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:33:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 13:33:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 13:33:49,660 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:49,660 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-07-25 13:33:49,660 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-07-25 13:33:49,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:50,049 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:33:50,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:50,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:33:50,049 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:33:50,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:33:50,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:33:50,051 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-07-25 13:33:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:50,113 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:33:50,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:33:50,114 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-07-25 13:33:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:50,114 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:33:50,114 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:33:50,115 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:33:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:33:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:33:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:33:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:33:50,118 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 13:33:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:50,118 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:33:50,118 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:33:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:33:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:33:50,119 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:50,119 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-07-25 13:33:50,119 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-07-25 13:33:50,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:50,498 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:33:50,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:50,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:33:50,499 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:33:50,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:33:50,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:33:50,500 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-07-25 13:33:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:50,726 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 13:33:50,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:33:50,726 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-07-25 13:33:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:50,727 INFO L225 Difference]: With dead ends: 118 [2018-07-25 13:33:50,727 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 13:33:50,727 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:33:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 13:33:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 13:33:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 13:33:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 13:33:50,731 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 13:33:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:50,731 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 13:33:50,731 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:33:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 13:33:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 13:33:50,732 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:50,732 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-07-25 13:33:50,732 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-07-25 13:33:50,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:51,259 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:33:51,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:51,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:33:51,260 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:33:51,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:33:51,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:33:51,262 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-07-25 13:33:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:51,438 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:33:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:33:51,438 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-07-25 13:33:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:51,439 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:33:51,439 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:33:51,440 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:33:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:33:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:33:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:33:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:33:51,443 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 13:33:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:51,444 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:33:51,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:33:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:33:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:33:51,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:51,445 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-07-25 13:33:51,445 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:51,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-07-25 13:33:51,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:51,914 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:33:51,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:51,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:33:51,915 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:33:51,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:33:51,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:33:51,916 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-07-25 13:33:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:52,080 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 13:33:52,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:33:52,081 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-07-25 13:33:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:52,081 INFO L225 Difference]: With dead ends: 120 [2018-07-25 13:33:52,081 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 13:33:52,082 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:33:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 13:33:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 13:33:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 13:33:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 13:33:52,086 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 13:33:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:52,086 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 13:33:52,086 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:33:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 13:33:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 13:33:52,087 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:52,087 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-07-25 13:33:52,087 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-07-25 13:33:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:52,611 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:33:52,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:52,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:33:52,612 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:33:52,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:33:52,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:33:52,614 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-07-25 13:33:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:52,732 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:33:52,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:33:52,732 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-07-25 13:33:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:52,733 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:33:52,733 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:33:52,734 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:33:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:33:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:33:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:33:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:33:52,737 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 13:33:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:52,738 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:33:52,738 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:33:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:33:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:33:52,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:52,739 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-07-25 13:33:52,739 INFO L415 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2018-07-25 13:33:52,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:53,106 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:33:53,107 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:53,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:33:53,107 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:33:53,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:33:53,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:33:53,109 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-07-25 13:33:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:53,250 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 13:33:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:33:53,250 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-07-25 13:33:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:53,251 INFO L225 Difference]: With dead ends: 122 [2018-07-25 13:33:53,251 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 13:33:53,252 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:33:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 13:33:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 13:33:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 13:33:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 13:33:53,255 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 13:33:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:53,255 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 13:33:53,256 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:33:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 13:33:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 13:33:53,256 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:53,256 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-07-25 13:33:53,257 INFO L415 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:53,257 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2018-07-25 13:33:53,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:53,714 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:33:53,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:53,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:33:53,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:33:53,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:33:53,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:33:53,717 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-07-25 13:33:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:53,834 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:33:53,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:33:53,834 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-07-25 13:33:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:53,835 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:33:53,835 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:33:53,836 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:33:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:33:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:33:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:33:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:33:53,840 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 13:33:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:53,841 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:33:53,841 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:33:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:33:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:33:53,842 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:53,842 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-07-25 13:33:53,842 INFO L415 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2018-07-25 13:33:53,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:54,272 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:33:54,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:54,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:33:54,272 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:33:54,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:33:54,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:33:54,274 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-07-25 13:33:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:54,412 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 13:33:54,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:33:54,412 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-07-25 13:33:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:54,413 INFO L225 Difference]: With dead ends: 124 [2018-07-25 13:33:54,413 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 13:33:54,414 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:33:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 13:33:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 13:33:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 13:33:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 13:33:54,417 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 13:33:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:54,417 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 13:33:54,418 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:33:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 13:33:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 13:33:54,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:54,418 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-07-25 13:33:54,419 INFO L415 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2018-07-25 13:33:54,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:54,795 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:33:54,795 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:54,795 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:33:54,796 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:33:54,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:33:54,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:33:54,798 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-07-25 13:33:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:54,919 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:33:54,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:33:54,920 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-07-25 13:33:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:54,920 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:33:54,920 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:33:54,921 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:33:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:33:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:33:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:33:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:33:54,923 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 13:33:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:54,923 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:33:54,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:33:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:33:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:33:54,924 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:54,924 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-07-25 13:33:54,925 INFO L415 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:54,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432762, now seen corresponding path program 119 times [2018-07-25 13:33:54,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:55,357 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:33:55,358 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:55,358 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:33:55,358 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:33:55,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:33:55,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:33:55,360 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-07-25 13:33:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:55,419 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 13:33:55,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:33:55,419 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-07-25 13:33:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:55,420 INFO L225 Difference]: With dead ends: 126 [2018-07-25 13:33:55,420 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 13:33:55,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:33:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 13:33:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 13:33:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 13:33:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 13:33:55,424 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 13:33:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:55,424 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 13:33:55,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:33:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 13:33:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 13:33:55,425 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:55,425 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-07-25 13:33:55,426 INFO L415 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:55,426 INFO L82 PathProgramCache]: Analyzing trace with hash -900681120, now seen corresponding path program 120 times [2018-07-25 13:33:55,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:56,006 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:33:56,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:56,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:33:56,007 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:33:56,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:33:56,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:33:56,008 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-07-25 13:33:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:56,135 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:33:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:33:56,135 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-07-25 13:33:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:56,135 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:33:56,136 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:33:56,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:33:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:33:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:33:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:33:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:33:56,140 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 13:33:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:56,140 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:33:56,140 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:33:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:33:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:33:56,141 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:56,141 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-07-25 13:33:56,142 INFO L415 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652486, now seen corresponding path program 121 times [2018-07-25 13:33:56,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:56,529 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:33:56,529 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:56,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:33:56,530 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:33:56,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:33:56,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:33:56,532 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-07-25 13:33:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:56,657 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 13:33:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:33:56,657 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-07-25 13:33:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:56,658 INFO L225 Difference]: With dead ends: 128 [2018-07-25 13:33:56,658 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 13:33:56,659 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:33:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 13:33:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 13:33:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 13:33:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 13:33:56,662 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 13:33:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:56,663 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 13:33:56,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:33:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 13:33:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 13:33:56,664 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:56,664 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-07-25 13:33:56,664 INFO L415 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713760, now seen corresponding path program 122 times [2018-07-25 13:33:56,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:57,110 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:33:57,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:57,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:33:57,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:33:57,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:33:57,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:33:57,113 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-07-25 13:33:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:57,287 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:33:57,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:33:57,287 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-07-25 13:33:57,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:57,288 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:33:57,288 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:33:57,289 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:33:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:33:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:33:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:33:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:33:57,292 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 13:33:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:57,292 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:33:57,292 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:33:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:33:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:33:57,293 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:57,293 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-07-25 13:33:57,294 INFO L415 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386746, now seen corresponding path program 123 times [2018-07-25 13:33:57,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:57,676 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:33:57,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:57,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:33:57,676 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:33:57,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:33:57,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:33:57,678 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-07-25 13:33:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:57,771 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 13:33:57,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:33:57,772 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-07-25 13:33:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:57,772 INFO L225 Difference]: With dead ends: 130 [2018-07-25 13:33:57,772 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 13:33:57,773 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:33:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 13:33:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 13:33:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 13:33:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 13:33:57,776 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 13:33:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:57,776 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 13:33:57,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:33:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 13:33:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 13:33:57,777 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:57,777 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-07-25 13:33:57,777 INFO L415 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash -321352736, now seen corresponding path program 124 times [2018-07-25 13:33:57,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:58,234 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:33:58,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:58,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:33:58,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:33:58,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:33:58,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:33:58,237 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-07-25 13:33:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:58,440 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:33:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:33:58,440 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-07-25 13:33:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:58,441 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:33:58,441 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:33:58,442 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:33:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:33:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:33:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:33:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:33:58,446 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 13:33:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:58,446 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:33:58,446 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:33:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:33:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:33:58,447 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:58,447 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-07-25 13:33:58,447 INFO L415 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004090, now seen corresponding path program 125 times [2018-07-25 13:33:58,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:58,829 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:33:58,829 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:58,829 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:33:58,829 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:33:58,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:33:58,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:33:58,831 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-07-25 13:33:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:58,909 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 13:33:58,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:33:58,909 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-07-25 13:33:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:58,909 INFO L225 Difference]: With dead ends: 132 [2018-07-25 13:33:58,909 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 13:33:58,911 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:33:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 13:33:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 13:33:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 13:33:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 13:33:58,913 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 13:33:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:58,913 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 13:33:58,913 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:33:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 13:33:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 13:33:58,914 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:58,914 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-07-25 13:33:58,914 INFO L415 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash 417542304, now seen corresponding path program 126 times [2018-07-25 13:33:58,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:59,358 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:33:59,358 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:59,359 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:33:59,359 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:33:59,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:33:59,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:33:59,362 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-07-25 13:33:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:59,555 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:33:59,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:33:59,555 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-07-25 13:33:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:59,555 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:33:59,556 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:33:59,557 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:33:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:33:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:33:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:33:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:33:59,561 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 13:33:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:59,561 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:33:59,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:33:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:33:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:33:59,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:59,562 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-07-25 13:33:59,562 INFO L415 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash 58905670, now seen corresponding path program 127 times [2018-07-25 13:33:59,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:00,225 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:34:00,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:00,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:34:00,226 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:34:00,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:34:00,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:34:00,234 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-07-25 13:34:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:00,381 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 13:34:00,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:34:00,382 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-07-25 13:34:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:00,383 INFO L225 Difference]: With dead ends: 134 [2018-07-25 13:34:00,383 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 13:34:00,385 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:34:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 13:34:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 13:34:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 13:34:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 13:34:00,391 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 13:34:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:00,393 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 13:34:00,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:34:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 13:34:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 13:34:00,396 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:00,396 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-07-25 13:34:00,396 INFO L415 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071904, now seen corresponding path program 128 times [2018-07-25 13:34:00,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:00,908 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:34:00,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:00,909 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:34:00,909 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:34:00,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:34:00,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:34:00,912 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-07-25 13:34:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:01,070 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:34:01,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:34:01,070 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-07-25 13:34:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:01,071 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:34:01,071 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:34:01,072 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:34:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:34:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:34:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:34:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:34:01,075 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 13:34:01,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:01,075 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:34:01,075 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:34:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:34:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:34:01,076 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:01,076 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-07-25 13:34:01,076 INFO L415 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 773650310, now seen corresponding path program 129 times [2018-07-25 13:34:01,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:01,549 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:34:01,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:01,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:34:01,550 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:34:01,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:34:01,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:34:01,552 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-07-25 13:34:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:01,727 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 13:34:01,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:34:01,727 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-07-25 13:34:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:01,728 INFO L225 Difference]: With dead ends: 136 [2018-07-25 13:34:01,728 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 13:34:01,729 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:34:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 13:34:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 13:34:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 13:34:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 13:34:01,732 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 13:34:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:01,732 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 13:34:01,732 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:34:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 13:34:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 13:34:01,733 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:01,733 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-07-25 13:34:01,733 INFO L415 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648032, now seen corresponding path program 130 times [2018-07-25 13:34:01,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:02,168 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:34:02,169 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:02,169 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:34:02,169 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:34:02,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:34:02,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:34:02,171 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-07-25 13:34:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:02,295 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:34:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:34:02,296 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-07-25 13:34:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:02,296 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:34:02,296 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:34:02,297 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:34:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:34:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:34:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:34:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:34:02,300 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 13:34:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:02,301 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:34:02,301 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:34:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:34:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:34:02,301 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:02,302 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-07-25 13:34:02,302 INFO L415 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash 448481990, now seen corresponding path program 131 times [2018-07-25 13:34:02,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:02,751 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:34:02,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:02,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:34:02,751 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:34:02,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:34:02,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:34:02,754 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-07-25 13:34:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:02,947 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 13:34:02,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:34:02,947 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-07-25 13:34:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:02,948 INFO L225 Difference]: With dead ends: 138 [2018-07-25 13:34:02,948 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 13:34:02,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:34:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 13:34:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 13:34:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 13:34:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 13:34:02,952 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 13:34:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:02,952 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 13:34:02,952 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:34:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 13:34:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 13:34:02,953 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:02,953 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-07-25 13:34:02,953 INFO L415 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035936, now seen corresponding path program 132 times [2018-07-25 13:34:02,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:03,452 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:34:03,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:03,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:34:03,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:34:03,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:34:03,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:34:03,455 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-07-25 13:34:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:03,628 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:34:03,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:34:03,628 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-07-25 13:34:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:03,629 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:34:03,629 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:34:03,630 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:34:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:34:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:34:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:34:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:34:03,633 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 13:34:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:03,633 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:34:03,633 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:34:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:34:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:34:03,634 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:03,634 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-07-25 13:34:03,635 INFO L415 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1494339078, now seen corresponding path program 133 times [2018-07-25 13:34:03,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:04,082 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:34:04,082 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:04,082 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:34:04,082 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:34:04,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:34:04,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:34:04,086 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-07-25 13:34:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:04,231 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 13:34:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:34:04,231 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-07-25 13:34:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:04,232 INFO L225 Difference]: With dead ends: 140 [2018-07-25 13:34:04,232 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 13:34:04,233 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:34:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 13:34:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 13:34:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 13:34:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 13:34:04,236 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 13:34:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:04,236 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 13:34:04,237 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:34:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 13:34:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 13:34:04,237 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:04,237 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-07-25 13:34:04,238 INFO L415 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash -920132704, now seen corresponding path program 134 times [2018-07-25 13:34:04,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:04,715 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:34:04,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:04,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:34:04,716 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:34:04,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:34:04,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:34:04,718 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-07-25 13:34:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:04,905 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:34:04,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:34:04,905 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-07-25 13:34:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:04,905 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:34:04,905 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:34:04,906 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:34:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:34:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:34:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:34:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:34:04,908 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 13:34:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:04,909 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:34:04,909 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:34:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:34:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:34:04,909 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:04,910 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-07-25 13:34:04,910 INFO L415 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:04,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653382, now seen corresponding path program 135 times [2018-07-25 13:34:04,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:05,398 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:34:05,398 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:05,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:34:05,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:34:05,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:34:05,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:34:05,401 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-07-25 13:34:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:05,635 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 13:34:05,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:34:05,636 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-07-25 13:34:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:05,636 INFO L225 Difference]: With dead ends: 142 [2018-07-25 13:34:05,636 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 13:34:05,637 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:34:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 13:34:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 13:34:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 13:34:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 13:34:05,640 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 13:34:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:05,640 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 13:34:05,640 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:34:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 13:34:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 13:34:05,641 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:05,641 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-07-25 13:34:05,641 INFO L415 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:05,641 INFO L82 PathProgramCache]: Analyzing trace with hash 515610720, now seen corresponding path program 136 times [2018-07-25 13:34:05,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:06,312 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:34:06,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:06,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:34:06,312 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:34:06,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:34:06,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:34:06,314 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-07-25 13:34:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:06,419 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:34:06,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:34:06,419 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-07-25 13:34:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:06,420 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:34:06,420 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:34:06,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:34:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:34:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:34:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:34:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:34:06,423 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 13:34:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:06,423 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:34:06,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:34:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:34:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:34:06,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:06,424 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-07-25 13:34:06,424 INFO L415 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940730, now seen corresponding path program 137 times [2018-07-25 13:34:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:06,929 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:34:06,929 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:06,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:34:06,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:34:06,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:34:06,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:34:06,932 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-07-25 13:34:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:07,136 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 13:34:07,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:34:07,136 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-07-25 13:34:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:07,136 INFO L225 Difference]: With dead ends: 144 [2018-07-25 13:34:07,136 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 13:34:07,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:34:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 13:34:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 13:34:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 13:34:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 13:34:07,139 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 13:34:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:07,140 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 13:34:07,140 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:34:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 13:34:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 13:34:07,140 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:07,140 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-07-25 13:34:07,140 INFO L415 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539168, now seen corresponding path program 138 times [2018-07-25 13:34:07,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:07,649 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:34:07,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:07,649 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:34:07,650 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:34:07,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:34:07,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:34:07,652 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-07-25 13:34:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:07,874 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:34:07,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:34:07,874 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-07-25 13:34:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:07,875 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:34:07,875 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:34:07,876 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:34:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:34:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:34:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:34:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:34:07,879 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 13:34:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:07,879 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:34:07,879 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:34:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:34:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:34:07,880 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:07,880 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-07-25 13:34:07,880 INFO L415 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1752070086, now seen corresponding path program 139 times [2018-07-25 13:34:07,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:08,392 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:34:08,392 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:08,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:34:08,393 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:34:08,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:34:08,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:34:08,395 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-07-25 13:34:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:08,665 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 13:34:08,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:34:08,666 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-07-25 13:34:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:08,666 INFO L225 Difference]: With dead ends: 146 [2018-07-25 13:34:08,666 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 13:34:08,667 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:34:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 13:34:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 13:34:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 13:34:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 13:34:08,670 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 13:34:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:08,670 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 13:34:08,670 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:34:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 13:34:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 13:34:08,670 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:08,671 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-07-25 13:34:08,671 INFO L415 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:08,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406048, now seen corresponding path program 140 times [2018-07-25 13:34:08,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:09,200 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:34:09,201 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:09,201 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:34:09,201 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:34:09,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:34:09,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:34:09,204 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-07-25 13:34:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:09,416 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:34:09,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:34:09,416 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-07-25 13:34:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:09,416 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:34:09,416 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:34:09,417 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:34:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:34:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:34:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:34:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:34:09,419 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 13:34:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:09,420 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:34:09,420 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:34:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:34:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:34:09,420 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:09,421 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-07-25 13:34:09,421 INFO L415 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash 112048902, now seen corresponding path program 141 times [2018-07-25 13:34:09,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:10,033 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:34:10,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:10,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:34:10,034 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:34:10,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:34:10,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:34:10,037 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-07-25 13:34:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:10,171 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 13:34:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:34:10,171 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-07-25 13:34:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:10,172 INFO L225 Difference]: With dead ends: 148 [2018-07-25 13:34:10,172 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 13:34:10,173 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:34:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 13:34:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 13:34:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 13:34:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 13:34:10,175 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 13:34:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:10,175 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 13:34:10,176 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:34:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 13:34:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 13:34:10,176 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:10,176 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-07-25 13:34:10,176 INFO L415 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash -821455200, now seen corresponding path program 142 times [2018-07-25 13:34:10,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:10,749 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:34:10,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:10,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:34:10,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:34:10,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:34:10,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:34:10,752 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-07-25 13:34:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:10,878 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:34:10,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:34:10,878 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-07-25 13:34:10,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:10,879 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:34:10,879 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:34:10,880 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:34:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:34:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:34:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:34:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:34:10,882 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 13:34:10,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:10,882 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:34:10,883 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:34:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:34:10,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:34:10,883 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:10,884 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-07-25 13:34:10,884 INFO L415 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:10,884 INFO L82 PathProgramCache]: Analyzing trace with hash 304688710, now seen corresponding path program 143 times [2018-07-25 13:34:10,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:11,406 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:34:11,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:11,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:34:11,407 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:34:11,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:34:11,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:34:11,410 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-07-25 13:34:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:11,681 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 13:34:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:34:11,681 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-07-25 13:34:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:11,682 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:34:11,682 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 13:34:11,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:34:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 13:34:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 13:34:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 13:34:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 13:34:11,686 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 13:34:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:11,686 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 13:34:11,686 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:34:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 13:34:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 13:34:11,686 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:11,686 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-07-25 13:34:11,687 INFO L415 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash 855411552, now seen corresponding path program 144 times [2018-07-25 13:34:11,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:12,219 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:34:12,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:12,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:34:12,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:34:12,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:34:12,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:34:12,222 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-07-25 13:34:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:12,543 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:34:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:34:12,543 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-07-25 13:34:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:12,543 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:34:12,543 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:34:12,544 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:34:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:34:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:34:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:34:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:34:12,547 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 13:34:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:12,547 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:34:12,547 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:34:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:34:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:34:12,548 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:12,548 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-07-25 13:34:12,548 INFO L415 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash 747950470, now seen corresponding path program 145 times [2018-07-25 13:34:12,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:13,139 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:34:13,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:13,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:34:13,139 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:34:13,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:34:13,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:34:13,142 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-07-25 13:34:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:13,432 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 13:34:13,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:34:13,432 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-07-25 13:34:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:13,433 INFO L225 Difference]: With dead ends: 152 [2018-07-25 13:34:13,433 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 13:34:13,434 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:34:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 13:34:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 13:34:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 13:34:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 13:34:13,438 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 13:34:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:13,438 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 13:34:13,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:34:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 13:34:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 13:34:13,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:13,439 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-07-25 13:34:13,439 INFO L415 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624224, now seen corresponding path program 146 times [2018-07-25 13:34:13,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:14,048 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:34:14,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:14,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:34:14,049 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:34:14,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:34:14,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:34:14,051 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-07-25 13:34:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:14,331 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:34:14,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:34:14,331 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-07-25 13:34:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:14,331 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:34:14,332 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:34:14,333 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:34:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:34:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:34:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:34:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:34:14,336 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 13:34:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:14,336 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:34:14,336 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:34:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:34:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:34:14,337 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:14,337 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-07-25 13:34:14,337 INFO L415 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739526, now seen corresponding path program 147 times [2018-07-25 13:34:14,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:14,864 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:14,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:14,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:34:14,864 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:34:14,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:34:14,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:34:14,867 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-07-25 13:34:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:15,165 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 13:34:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:34:15,165 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-07-25 13:34:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:15,166 INFO L225 Difference]: With dead ends: 154 [2018-07-25 13:34:15,166 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 13:34:15,167 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:34:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 13:34:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 13:34:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 13:34:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 13:34:15,169 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 13:34:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:15,169 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 13:34:15,169 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:34:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 13:34:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 13:34:15,170 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:15,170 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-07-25 13:34:15,170 INFO L415 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash -101718816, now seen corresponding path program 148 times [2018-07-25 13:34:15,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:15,748 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:15,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:15,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:34:15,749 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:34:15,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:34:15,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:34:15,752 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-07-25 13:34:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:16,083 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:34:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:34:16,083 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-07-25 13:34:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:16,084 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:34:16,084 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:34:16,085 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:34:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:34:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:34:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:34:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:34:16,087 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 13:34:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:16,087 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:34:16,087 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:34:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:34:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:34:16,088 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:16,088 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-07-25 13:34:16,088 INFO L415 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680134, now seen corresponding path program 149 times [2018-07-25 13:34:16,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:16,648 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:16,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:16,649 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:34:16,649 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:34:16,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:34:16,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:34:16,651 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-07-25 13:34:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:17,017 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 13:34:17,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:34:17,018 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-07-25 13:34:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:17,018 INFO L225 Difference]: With dead ends: 156 [2018-07-25 13:34:17,018 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 13:34:17,019 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:34:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 13:34:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 13:34:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 13:34:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 13:34:17,021 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 13:34:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:17,021 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 13:34:17,022 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:34:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 13:34:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 13:34:17,022 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:17,022 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-07-25 13:34:17,023 INFO L415 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341920, now seen corresponding path program 150 times [2018-07-25 13:34:17,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:17,610 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:17,610 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:17,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 13:34:17,610 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:34:17,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:34:17,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:34:17,612 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-07-25 13:34:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:17,937 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:34:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:34:17,937 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-07-25 13:34:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:17,938 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:34:17,938 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:34:17,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:34:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:34:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:34:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:34:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:34:17,941 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 13:34:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:17,941 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:34:17,941 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 13:34:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:34:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:34:17,941 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:17,941 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-07-25 13:34:17,942 INFO L415 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824582, now seen corresponding path program 151 times [2018-07-25 13:34:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:18,502 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:18,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:34:18,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:34:18,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:34:18,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:34:18,505 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-07-25 13:34:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:18,832 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 13:34:18,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:34:18,832 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-07-25 13:34:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:18,832 INFO L225 Difference]: With dead ends: 158 [2018-07-25 13:34:18,832 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 13:34:18,833 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:34:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 13:34:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 13:34:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 13:34:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 13:34:18,835 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 13:34:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:18,836 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 13:34:18,836 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 13:34:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 13:34:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 13:34:18,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:18,836 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-07-25 13:34:18,836 INFO L415 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash -56983968, now seen corresponding path program 152 times [2018-07-25 13:34:18,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:19,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:19,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 13:34:19,474 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 13:34:19,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 13:34:19,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:34:19,476 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-07-25 13:34:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:19,803 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:34:19,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:34:19,804 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-07-25 13:34:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:19,804 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:34:19,804 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:34:19,805 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:34:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:34:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:34:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:34:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:34:19,808 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 13:34:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:19,809 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:34:19,809 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 13:34:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:34:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:34:19,809 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:19,810 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-07-25 13:34:19,810 INFO L415 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:19,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1766506874, now seen corresponding path program 153 times [2018-07-25 13:34:19,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:20,466 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:20,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 13:34:20,466 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 13:34:20,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 13:34:20,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:34:20,469 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-07-25 13:34:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:20,808 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 13:34:20,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 13:34:20,809 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-07-25 13:34:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:20,809 INFO L225 Difference]: With dead ends: 160 [2018-07-25 13:34:20,809 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 13:34:20,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:34:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 13:34:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 13:34:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 13:34:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 13:34:20,813 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 13:34:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:20,813 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 13:34:20,813 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 13:34:20,813 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 13:34:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 13:34:20,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:20,813 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-07-25 13:34:20,814 INFO L415 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1072857888, now seen corresponding path program 154 times [2018-07-25 13:34:20,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:21,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:21,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 13:34:21,504 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 13:34:21,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 13:34:21,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:34:21,507 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-07-25 13:34:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:21,825 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:34:21,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:34:21,825 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-07-25 13:34:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:21,826 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:34:21,826 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:34:21,826 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:34:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:34:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:34:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:34:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:34:21,829 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 13:34:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:21,829 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:34:21,829 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 13:34:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:34:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:34:21,830 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:21,830 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-07-25 13:34:21,830 INFO L415 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1101147706, now seen corresponding path program 155 times [2018-07-25 13:34:21,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:22,463 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:22,463 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 13:34:22,463 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 13:34:22,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 13:34:22,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:34:22,466 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-07-25 13:34:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:22,656 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 13:34:22,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:34:22,656 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-07-25 13:34:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:22,657 INFO L225 Difference]: With dead ends: 162 [2018-07-25 13:34:22,657 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 13:34:22,658 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:34:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 13:34:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 13:34:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 13:34:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 13:34:22,661 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 13:34:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:22,661 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 13:34:22,661 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 13:34:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 13:34:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 13:34:22,661 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:22,662 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-07-25 13:34:22,662 INFO L415 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash 224155616, now seen corresponding path program 156 times [2018-07-25 13:34:22,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:23,356 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:23,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 13:34:23,356 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 13:34:23,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 13:34:23,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:34:23,360 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-07-25 13:34:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:23,494 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:34:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 13:34:23,494 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-07-25 13:34:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:23,495 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:34:23,495 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:34:23,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:34:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:34:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:34:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:34:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:34:23,498 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 13:34:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:23,498 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:34:23,498 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 13:34:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:34:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:34:23,499 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:23,499 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-07-25 13:34:23,499 INFO L415 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:23,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1641114362, now seen corresponding path program 157 times [2018-07-25 13:34:23,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:24,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:24,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 13:34:24,223 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 13:34:24,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 13:34:24,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:34:24,226 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-07-25 13:34:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:24,525 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 13:34:24,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:34:24,526 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-07-25 13:34:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:24,526 INFO L225 Difference]: With dead ends: 164 [2018-07-25 13:34:24,526 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 13:34:24,527 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:34:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 13:34:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 13:34:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 13:34:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 13:34:24,529 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 13:34:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:24,529 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 13:34:24,529 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 13:34:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 13:34:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 13:34:24,530 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:24,530 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-07-25 13:34:24,530 INFO L415 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:24,530 INFO L82 PathProgramCache]: Analyzing trace with hash 665058464, now seen corresponding path program 158 times [2018-07-25 13:34:24,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:25,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:25,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 13:34:25,207 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 13:34:25,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 13:34:25,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:34:25,209 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-07-25 13:34:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:25,645 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:34:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 13:34:25,645 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-07-25 13:34:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:25,645 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:34:25,646 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:34:25,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:34:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:34:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:34:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:34:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:34:25,649 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 13:34:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:25,649 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:34:25,649 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 13:34:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:34:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:34:25,650 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:25,650 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-07-25 13:34:25,650 INFO L415 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash -858027962, now seen corresponding path program 159 times [2018-07-25 13:34:25,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:26,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:26,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 13:34:26,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 13:34:26,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 13:34:26,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:34:26,305 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-07-25 13:34:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:26,715 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 13:34:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:34:26,715 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-07-25 13:34:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:26,715 INFO L225 Difference]: With dead ends: 166 [2018-07-25 13:34:26,716 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 13:34:26,717 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:34:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 13:34:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 13:34:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 13:34:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 13:34:26,720 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 13:34:26,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:26,721 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 13:34:26,721 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 13:34:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 13:34:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 13:34:26,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:26,722 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-07-25 13:34:26,722 INFO L415 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash -829066912, now seen corresponding path program 160 times [2018-07-25 13:34:26,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:27,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:27,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 13:34:27,428 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 13:34:27,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 13:34:27,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:34:27,431 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-07-25 13:34:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:27,796 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:34:27,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 13:34:27,796 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-07-25 13:34:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:27,797 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:34:27,797 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:34:27,798 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:34:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:34:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:34:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:34:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:34:27,801 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 13:34:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:27,801 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:34:27,801 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 13:34:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:34:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:34:27,802 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:27,802 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-07-25 13:34:27,802 INFO L415 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash 68725638, now seen corresponding path program 161 times [2018-07-25 13:34:27,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:28,527 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:28,527 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 13:34:28,527 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 13:34:28,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 13:34:28,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:34:28,530 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-07-25 13:34:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:28,670 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 13:34:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:34:28,670 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-07-25 13:34:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:28,670 INFO L225 Difference]: With dead ends: 168 [2018-07-25 13:34:28,670 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 13:34:28,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:34:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 13:34:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 13:34:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 13:34:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 13:34:28,676 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 13:34:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:28,676 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 13:34:28,676 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 13:34:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 13:34:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 13:34:28,677 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:28,677 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-07-25 13:34:28,677 INFO L415 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2130490912, now seen corresponding path program 162 times [2018-07-25 13:34:28,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:29,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:29,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 13:34:29,471 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 13:34:29,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 13:34:29,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:34:29,474 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-07-25 13:34:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:29,932 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:34:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:34:29,932 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-07-25 13:34:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:29,932 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:34:29,932 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:34:29,934 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:34:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:34:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:34:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:34:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:34:29,936 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 13:34:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:29,936 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:34:29,936 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 13:34:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:34:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:34:29,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:29,937 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-07-25 13:34:29,937 INFO L415 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1620704966, now seen corresponding path program 163 times [2018-07-25 13:34:29,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:30,672 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:30,672 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 13:34:30,673 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 13:34:30,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 13:34:30,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:34:30,676 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-07-25 13:34:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:31,158 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 13:34:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 13:34:31,158 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-07-25 13:34:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:31,159 INFO L225 Difference]: With dead ends: 170 [2018-07-25 13:34:31,159 INFO L226 Difference]: Without dead ends: 168 [2018-07-25 13:34:31,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:34:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-25 13:34:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-25 13:34:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 13:34:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 13:34:31,162 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-07-25 13:34:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:31,162 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 13:34:31,162 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 13:34:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 13:34:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 13:34:31,163 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:31,163 INFO L354 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-07-25 13:34:31,163 INFO L415 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1297757472, now seen corresponding path program 164 times [2018-07-25 13:34:31,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:31,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:31,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 13:34:31,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 13:34:31,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 13:34:31,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:34:31,851 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-07-25 13:34:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:32,255 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:34:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:34:32,255 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-07-25 13:34:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:32,255 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:34:32,255 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:34:32,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:34:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:34:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:34:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:34:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:34:32,260 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-07-25 13:34:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:32,260 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:34:32,260 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 13:34:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:34:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:34:32,261 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:32,261 INFO L354 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-07-25 13:34:32,261 INFO L415 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:32,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1575779834, now seen corresponding path program 165 times [2018-07-25 13:34:32,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:33,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:33,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 13:34:33,063 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 13:34:33,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 13:34:33,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:34:33,066 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-07-25 13:34:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:33,287 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 13:34:33,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 13:34:33,287 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-07-25 13:34:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:33,288 INFO L225 Difference]: With dead ends: 172 [2018-07-25 13:34:33,288 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 13:34:33,289 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:34:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 13:34:33,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-25 13:34:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 13:34:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 13:34:33,293 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-07-25 13:34:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:33,293 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 13:34:33,293 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 13:34:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 13:34:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 13:34:33,294 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:33,294 INFO L354 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-07-25 13:34:33,294 INFO L415 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1604538464, now seen corresponding path program 166 times [2018-07-25 13:34:33,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:34,147 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:34,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 13:34:34,148 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 13:34:34,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 13:34:34,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:34:34,150 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-07-25 13:34:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:34,792 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:34:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:34:34,792 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-07-25 13:34:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:34,792 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:34:34,792 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:34:34,793 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:34:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:34:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:34:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:34:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:34:34,795 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-07-25 13:34:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:34,795 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:34:34,796 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 13:34:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:34:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:34:34,796 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:34,796 INFO L354 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-07-25 13:34:34,796 INFO L415 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1798911302, now seen corresponding path program 167 times [2018-07-25 13:34:34,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:35,509 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:35,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 13:34:35,510 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 13:34:35,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 13:34:35,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:34:35,514 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-07-25 13:34:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:35,921 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 13:34:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 13:34:35,922 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-07-25 13:34:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:35,922 INFO L225 Difference]: With dead ends: 174 [2018-07-25 13:34:35,922 INFO L226 Difference]: Without dead ends: 172 [2018-07-25 13:34:35,924 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:34:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-25 13:34:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-25 13:34:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 13:34:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 13:34:35,927 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-07-25 13:34:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:35,927 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 13:34:35,927 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 13:34:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 13:34:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 13:34:35,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:35,928 INFO L354 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-07-25 13:34:35,928 INFO L415 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:35,928 INFO L82 PathProgramCache]: Analyzing trace with hash -68328352, now seen corresponding path program 168 times [2018-07-25 13:34:35,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:36,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:36,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 13:34:36,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 13:34:36,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 13:34:36,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:34:36,764 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-07-25 13:34:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:37,063 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:34:37,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:34:37,063 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-07-25 13:34:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:37,063 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:34:37,063 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:34:37,065 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:34:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:34:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:34:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:34:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:34:37,067 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-07-25 13:34:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:37,067 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:34:37,067 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 13:34:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:34:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:34:37,068 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:37,068 INFO L354 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-07-25 13:34:37,068 INFO L415 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2118182778, now seen corresponding path program 169 times [2018-07-25 13:34:37,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:37,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:37,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 13:34:37,904 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 13:34:37,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 13:34:37,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:34:37,907 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-07-25 13:34:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:38,485 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 13:34:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:34:38,485 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-07-25 13:34:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:38,486 INFO L225 Difference]: With dead ends: 176 [2018-07-25 13:34:38,486 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 13:34:38,487 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:34:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 13:34:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-25 13:34:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 13:34:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 13:34:38,489 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-07-25 13:34:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:38,489 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 13:34:38,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 13:34:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 13:34:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 13:34:38,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:38,490 INFO L354 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-07-25 13:34:38,490 INFO L415 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:38,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1239160544, now seen corresponding path program 170 times [2018-07-25 13:34:38,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:39,292 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:39,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 13:34:39,292 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 13:34:39,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 13:34:39,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:34:39,296 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-07-25 13:34:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:39,481 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:34:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 13:34:39,482 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-07-25 13:34:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:39,482 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:34:39,482 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:34:39,484 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:34:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:34:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:34:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:34:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:34:39,487 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-07-25 13:34:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:39,487 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:34:39,487 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 13:34:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:34:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:34:39,488 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:39,488 INFO L354 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-07-25 13:34:39,488 INFO L415 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:39,488 INFO L82 PathProgramCache]: Analyzing trace with hash 240724934, now seen corresponding path program 171 times [2018-07-25 13:34:39,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:40,319 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:40,319 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 13:34:40,320 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 13:34:40,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 13:34:40,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:34:40,323 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-07-25 13:34:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:40,967 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 13:34:40,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:34:40,967 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-07-25 13:34:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:40,968 INFO L225 Difference]: With dead ends: 178 [2018-07-25 13:34:40,968 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 13:34:40,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:34:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 13:34:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-25 13:34:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 13:34:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 13:34:40,973 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-07-25 13:34:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:40,973 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 13:34:40,973 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 13:34:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 13:34:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 13:34:40,974 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:40,974 INFO L354 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-07-25 13:34:40,975 INFO L415 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1127465504, now seen corresponding path program 172 times [2018-07-25 13:34:40,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:41,841 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:41,841 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 13:34:41,842 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 13:34:41,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 13:34:41,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:34:41,846 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-07-25 13:34:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:42,170 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:34:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 13:34:42,170 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-07-25 13:34:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:42,170 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:34:42,170 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:34:42,172 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:34:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:34:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:34:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:34:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:34:42,175 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-07-25 13:34:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:42,175 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:34:42,176 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 13:34:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:34:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:34:42,176 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:42,176 INFO L354 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-07-25 13:34:42,177 INFO L415 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash -591696122, now seen corresponding path program 173 times [2018-07-25 13:34:42,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:42,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:42,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 13:34:42,975 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 13:34:42,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 13:34:42,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:34:42,979 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 176 states. [2018-07-25 13:34:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:43,507 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 13:34:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:34:43,507 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-07-25 13:34:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:43,507 INFO L225 Difference]: With dead ends: 180 [2018-07-25 13:34:43,508 INFO L226 Difference]: Without dead ends: 178 [2018-07-25 13:34:43,508 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:34:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-25 13:34:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-25 13:34:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 13:34:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 13:34:43,510 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-07-25 13:34:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:43,511 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 13:34:43,511 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 13:34:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 13:34:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 13:34:43,511 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:43,511 INFO L354 BasicCegarLoop]: trace histogram [174, 1, 1, 1] [2018-07-25 13:34:43,511 INFO L415 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1162714464, now seen corresponding path program 174 times [2018-07-25 13:34:43,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:44,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:44,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 13:34:44,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 13:34:44,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 13:34:44,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:34:44,310 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 177 states. [2018-07-25 13:34:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:44,719 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:34:44,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 13:34:44,720 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 177 [2018-07-25 13:34:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:44,720 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:34:44,720 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:34:44,722 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:34:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:34:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:34:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:34:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:34:44,724 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-07-25 13:34:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:44,724 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:34:44,724 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 13:34:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:34:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:34:44,725 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:44,725 INFO L354 BasicCegarLoop]: trace histogram [175, 1, 1, 1] [2018-07-25 13:34:44,725 INFO L415 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:44,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1684413882, now seen corresponding path program 175 times [2018-07-25 13:34:44,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:45,558 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:45,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 13:34:45,559 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 13:34:45,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 13:34:45,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:34:45,562 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 178 states. [2018-07-25 13:34:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:46,118 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-25 13:34:46,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 13:34:46,118 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 178 [2018-07-25 13:34:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:46,118 INFO L225 Difference]: With dead ends: 182 [2018-07-25 13:34:46,118 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 13:34:46,120 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:34:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 13:34:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 13:34:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 13:34:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-25 13:34:46,122 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-07-25 13:34:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:46,122 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-25 13:34:46,122 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 13:34:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-25 13:34:46,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-25 13:34:46,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:46,123 INFO L354 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2018-07-25 13:34:46,123 INFO L415 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:46,123 INFO L82 PathProgramCache]: Analyzing trace with hash -677226656, now seen corresponding path program 176 times [2018-07-25 13:34:46,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:46,939 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:46,939 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 13:34:46,939 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 13:34:46,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 13:34:46,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:34:46,942 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2018-07-25 13:34:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:47,297 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:34:47,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 13:34:47,297 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2018-07-25 13:34:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:47,298 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:34:47,298 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:34:47,300 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:34:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:34:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:34:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:34:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:34:47,303 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-07-25 13:34:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:47,304 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:34:47,304 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 13:34:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:34:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:34:47,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:47,305 INFO L354 BasicCegarLoop]: trace histogram [177, 1, 1, 1] [2018-07-25 13:34:47,305 INFO L415 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:47,305 INFO L82 PathProgramCache]: Analyzing trace with hash 480806278, now seen corresponding path program 177 times [2018-07-25 13:34:47,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:48,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:48,136 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 13:34:48,136 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 13:34:48,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 13:34:48,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:34:48,140 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 180 states. [2018-07-25 13:34:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:48,812 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-25 13:34:48,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 13:34:48,812 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 180 [2018-07-25 13:34:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:48,813 INFO L225 Difference]: With dead ends: 184 [2018-07-25 13:34:48,813 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 13:34:48,814 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:34:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 13:34:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 13:34:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 13:34:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-25 13:34:48,817 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-07-25 13:34:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:48,817 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-25 13:34:48,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 13:34:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-25 13:34:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-25 13:34:48,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:48,818 INFO L354 BasicCegarLoop]: trace histogram [178, 1, 1, 1] [2018-07-25 13:34:48,818 INFO L415 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2020088864, now seen corresponding path program 178 times [2018-07-25 13:34:48,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:49,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:49,662 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 13:34:49,662 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 13:34:49,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 13:34:49,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:34:49,666 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 181 states. [2018-07-25 13:34:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:49,916 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:34:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 13:34:49,916 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 181 [2018-07-25 13:34:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:49,917 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:34:49,917 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:34:49,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:34:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:34:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:34:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:34:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:34:49,921 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-07-25 13:34:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:49,921 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:34:49,922 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 13:34:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:34:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:34:49,922 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:49,922 INFO L354 BasicCegarLoop]: trace histogram [179, 1, 1, 1] [2018-07-25 13:34:49,922 INFO L415 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:49,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1801758522, now seen corresponding path program 179 times [2018-07-25 13:34:49,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:50,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:50,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 13:34:50,825 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 13:34:50,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 13:34:50,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:34:50,829 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 182 states. [2018-07-25 13:34:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:51,566 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-25 13:34:51,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 13:34:51,567 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 182 [2018-07-25 13:34:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:51,567 INFO L225 Difference]: With dead ends: 186 [2018-07-25 13:34:51,567 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 13:34:51,569 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:34:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 13:34:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 13:34:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 13:34:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-25 13:34:51,572 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-07-25 13:34:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:51,572 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-25 13:34:51,572 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 13:34:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-25 13:34:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 13:34:51,573 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:51,573 INFO L354 BasicCegarLoop]: trace histogram [180, 1, 1, 1] [2018-07-25 13:34:51,573 INFO L415 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -19943200, now seen corresponding path program 180 times [2018-07-25 13:34:51,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:52,492 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:52,492 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 13:34:52,492 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 13:34:52,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 13:34:52,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:34:52,495 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 183 states. [2018-07-25 13:34:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:52,793 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:34:52,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 13:34:52,793 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 183 [2018-07-25 13:34:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:52,794 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:34:52,794 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:34:52,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:34:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:34:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:34:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:34:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:34:52,799 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-07-25 13:34:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:52,800 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:34:52,800 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 13:34:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:34:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:34:52,801 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:52,801 INFO L354 BasicCegarLoop]: trace histogram [181, 1, 1, 1] [2018-07-25 13:34:52,801 INFO L415 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:52,801 INFO L82 PathProgramCache]: Analyzing trace with hash -618243066, now seen corresponding path program 181 times [2018-07-25 13:34:52,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:53,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:53,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 13:34:53,705 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 13:34:53,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 13:34:53,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:34:53,708 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 184 states. [2018-07-25 13:34:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:54,237 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-07-25 13:34:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 13:34:54,238 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 184 [2018-07-25 13:34:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:54,238 INFO L225 Difference]: With dead ends: 188 [2018-07-25 13:34:54,238 INFO L226 Difference]: Without dead ends: 186 [2018-07-25 13:34:54,240 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:34:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-25 13:34:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-07-25 13:34:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-25 13:34:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-25 13:34:54,242 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-07-25 13:34:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:54,242 INFO L472 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-25 13:34:54,242 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 13:34:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-25 13:34:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-25 13:34:54,243 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:54,243 INFO L354 BasicCegarLoop]: trace histogram [182, 1, 1, 1] [2018-07-25 13:34:54,243 INFO L415 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1985669728, now seen corresponding path program 182 times [2018-07-25 13:34:54,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:55,179 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:55,179 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-25 13:34:55,180 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 13:34:55,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 13:34:55,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:34:55,185 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 185 states. [2018-07-25 13:34:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:55,939 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:34:55,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 13:34:55,939 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 185 [2018-07-25 13:34:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:55,940 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:34:55,940 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:34:55,941 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:34:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:34:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:34:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:34:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:34:55,944 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-07-25 13:34:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:55,944 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:34:55,944 INFO L473 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-25 13:34:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:34:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:34:55,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:55,945 INFO L354 BasicCegarLoop]: trace histogram [183, 1, 1, 1] [2018-07-25 13:34:55,945 INFO L415 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:55,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1426223290, now seen corresponding path program 183 times [2018-07-25 13:34:55,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:56,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:56,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-25 13:34:56,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-25 13:34:56,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-25 13:34:56,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:34:56,927 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 186 states. [2018-07-25 13:34:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:57,171 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-25 13:34:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 13:34:57,171 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 186 [2018-07-25 13:34:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:57,172 INFO L225 Difference]: With dead ends: 190 [2018-07-25 13:34:57,172 INFO L226 Difference]: Without dead ends: 188 [2018-07-25 13:34:57,173 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:34:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-25 13:34:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-25 13:34:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-25 13:34:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-25 13:34:57,176 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-07-25 13:34:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:57,176 INFO L472 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-25 13:34:57,176 INFO L473 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-25 13:34:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-25 13:34:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-25 13:34:57,176 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:57,177 INFO L354 BasicCegarLoop]: trace histogram [184, 1, 1, 1] [2018-07-25 13:34:57,177 INFO L415 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1263252896, now seen corresponding path program 184 times [2018-07-25 13:34:57,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:58,140 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:58,140 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-25 13:34:58,140 INFO L451 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-25 13:34:58,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-25 13:34:58,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:34:58,144 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 187 states. [2018-07-25 13:34:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:58,768 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:34:58,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-25 13:34:58,768 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 187 [2018-07-25 13:34:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:58,769 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:34:58,769 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:34:58,770 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:34:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:34:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:34:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:34:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:34:58,773 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-07-25 13:34:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:58,773 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:34:58,773 INFO L473 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-25 13:34:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:34:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:34:58,774 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:58,774 INFO L354 BasicCegarLoop]: trace histogram [185, 1, 1, 1] [2018-07-25 13:34:58,774 INFO L415 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash -506137978, now seen corresponding path program 185 times [2018-07-25 13:34:58,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:34:59,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:59,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-25 13:34:59,757 INFO L451 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-25 13:34:59,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-25 13:34:59,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:34:59,762 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 188 states. [2018-07-25 13:35:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:00,585 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-07-25 13:35:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-25 13:35:00,585 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 188 [2018-07-25 13:35:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:00,586 INFO L225 Difference]: With dead ends: 192 [2018-07-25 13:35:00,586 INFO L226 Difference]: Without dead ends: 190 [2018-07-25 13:35:00,587 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:35:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-25 13:35:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-07-25 13:35:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-25 13:35:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-07-25 13:35:00,589 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-07-25 13:35:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:00,590 INFO L472 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-07-25 13:35:00,590 INFO L473 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-25 13:35:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-07-25 13:35:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-25 13:35:00,590 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:00,590 INFO L354 BasicCegarLoop]: trace histogram [186, 1, 1, 1] [2018-07-25 13:35:00,590 INFO L415 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1489588000, now seen corresponding path program 186 times [2018-07-25 13:35:00,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:01,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:01,593 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-07-25 13:35:01,594 INFO L451 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-25 13:35:01,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-25 13:35:01,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:35:01,597 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 189 states. [2018-07-25 13:35:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:01,972 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 13:35:01,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-25 13:35:01,972 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 189 [2018-07-25 13:35:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:01,972 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:35:01,973 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:35:01,974 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:35:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:35:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:35:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:35:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:35:01,976 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 189 [2018-07-25 13:35:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:01,976 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:35:01,976 INFO L473 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-25 13:35:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:35:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:35:01,977 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:01,977 INFO L354 BasicCegarLoop]: trace histogram [187, 1, 1, 1] [2018-07-25 13:35:01,977 INFO L415 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:01,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1067416122, now seen corresponding path program 187 times [2018-07-25 13:35:01,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:03,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:03,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-07-25 13:35:03,014 INFO L451 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-07-25 13:35:03,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-07-25 13:35:03,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:35:03,018 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 190 states. [2018-07-25 13:35:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:03,337 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-07-25 13:35:03,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-07-25 13:35:03,337 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 190 [2018-07-25 13:35:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:03,337 INFO L225 Difference]: With dead ends: 194 [2018-07-25 13:35:03,337 INFO L226 Difference]: Without dead ends: 192 [2018-07-25 13:35:03,339 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:35:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-25 13:35:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-07-25 13:35:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-25 13:35:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-07-25 13:35:03,341 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 190 [2018-07-25 13:35:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:03,341 INFO L472 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-07-25 13:35:03,341 INFO L473 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-07-25 13:35:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-07-25 13:35:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-25 13:35:03,342 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:03,342 INFO L354 BasicCegarLoop]: trace histogram [188, 1, 1, 1] [2018-07-25 13:35:03,342 INFO L415 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1269834720, now seen corresponding path program 188 times [2018-07-25 13:35:03,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:04,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:04,308 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-07-25 13:35:04,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-07-25 13:35:04,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-07-25 13:35:04,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:35:04,314 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 191 states. [2018-07-25 13:35:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:05,070 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:35:05,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-07-25 13:35:05,070 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 191 [2018-07-25 13:35:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:05,071 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:35:05,071 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:35:05,073 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:35:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:35:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:35:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:35:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 13:35:05,077 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 191 [2018-07-25 13:35:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:05,077 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 13:35:05,077 INFO L473 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-07-25 13:35:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 13:35:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:35:05,078 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:05,078 INFO L354 BasicCegarLoop]: trace histogram [189, 1, 1, 1] [2018-07-25 13:35:05,079 INFO L415 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash 710166790, now seen corresponding path program 189 times [2018-07-25 13:35:05,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:06,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:06,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-07-25 13:35:06,190 INFO L451 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-07-25 13:35:06,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-07-25 13:35:06,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:35:06,193 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 192 states. [2018-07-25 13:35:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:07,114 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-07-25 13:35:07,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-07-25 13:35:07,114 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 192 [2018-07-25 13:35:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:07,114 INFO L225 Difference]: With dead ends: 196 [2018-07-25 13:35:07,115 INFO L226 Difference]: Without dead ends: 194 [2018-07-25 13:35:07,116 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:35:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-25 13:35:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-25 13:35:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 13:35:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-07-25 13:35:07,119 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 192 [2018-07-25 13:35:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:07,120 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-07-25 13:35:07,120 INFO L473 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-07-25 13:35:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-07-25 13:35:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-25 13:35:07,120 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:07,121 INFO L354 BasicCegarLoop]: trace histogram [190, 1, 1, 1] [2018-07-25 13:35:07,121 INFO L415 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:07,121 INFO L82 PathProgramCache]: Analyzing trace with hash 540330144, now seen corresponding path program 190 times [2018-07-25 13:35:07,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:08,116 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:08,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-07-25 13:35:08,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-07-25 13:35:08,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-07-25 13:35:08,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:35:08,120 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 193 states. [2018-07-25 13:35:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:08,685 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 13:35:08,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-07-25 13:35:08,685 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 193 [2018-07-25 13:35:08,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:08,685 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:35:08,685 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:35:08,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:35:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:35:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:35:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:35:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 13:35:08,689 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 193 [2018-07-25 13:35:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:08,690 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 13:35:08,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-07-25 13:35:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 13:35:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:35:08,690 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:08,690 INFO L354 BasicCegarLoop]: trace histogram [191, 1, 1, 1] [2018-07-25 13:35:08,690 INFO L415 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash -429638586, now seen corresponding path program 191 times [2018-07-25 13:35:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:09,799 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:09,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-07-25 13:35:09,800 INFO L451 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-07-25 13:35:09,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-07-25 13:35:09,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:35:09,805 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 194 states. [2018-07-25 13:35:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:10,111 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-07-25 13:35:10,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-25 13:35:10,111 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 194 [2018-07-25 13:35:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:10,112 INFO L225 Difference]: With dead ends: 198 [2018-07-25 13:35:10,112 INFO L226 Difference]: Without dead ends: 196 [2018-07-25 13:35:10,115 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:35:10,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-07-25 13:35:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-07-25 13:35:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 13:35:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-07-25 13:35:10,118 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 194 [2018-07-25 13:35:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:10,118 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-07-25 13:35:10,118 INFO L473 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-07-25 13:35:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-07-25 13:35:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-25 13:35:10,119 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:10,119 INFO L354 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2018-07-25 13:35:10,119 INFO L415 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash -433898144, now seen corresponding path program 192 times [2018-07-25 13:35:10,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:11,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:11,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-07-25 13:35:11,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-07-25 13:35:11,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-07-25 13:35:11,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:35:11,121 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 195 states. [2018-07-25 13:35:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,548 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 13:35:11,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-07-25 13:35:11,548 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 195 [2018-07-25 13:35:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,549 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:35:11,549 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:35:11,551 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:35:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:35:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:35:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:35:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 13:35:11,554 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 195 [2018-07-25 13:35:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:11,554 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 13:35:11,554 INFO L473 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-07-25 13:35:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 13:35:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:35:11,555 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:11,555 INFO L354 BasicCegarLoop]: trace histogram [193, 1, 1, 1] [2018-07-25 13:35:11,555 INFO L415 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:11,555 INFO L82 PathProgramCache]: Analyzing trace with hash -565944442, now seen corresponding path program 193 times [2018-07-25 13:35:11,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:12,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:12,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-07-25 13:35:12,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-07-25 13:35:12,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-07-25 13:35:12,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:35:12,696 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 196 states. [2018-07-25 13:35:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:13,411 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-07-25 13:35:13,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-07-25 13:35:13,411 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 196 [2018-07-25 13:35:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:13,411 INFO L225 Difference]: With dead ends: 200 [2018-07-25 13:35:13,411 INFO L226 Difference]: Without dead ends: 198 [2018-07-25 13:35:13,413 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:35:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-25 13:35:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-07-25 13:35:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-25 13:35:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-07-25 13:35:13,416 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 196 [2018-07-25 13:35:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:13,417 INFO L472 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-07-25 13:35:13,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-07-25 13:35:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-07-25 13:35:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-07-25 13:35:13,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:13,418 INFO L354 BasicCegarLoop]: trace histogram [194, 1, 1, 1] [2018-07-25 13:35:13,418 INFO L415 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash -364412384, now seen corresponding path program 194 times [2018-07-25 13:35:13,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:14,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:14,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-07-25 13:35:14,713 INFO L451 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-07-25 13:35:14,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-07-25 13:35:14,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:35:14,716 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 197 states. [2018-07-25 13:35:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:15,571 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 13:35:15,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-07-25 13:35:15,571 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 197 [2018-07-25 13:35:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:15,572 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:35:15,572 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:35:15,573 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:35:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:35:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:35:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:35:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 13:35:15,575 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 197 [2018-07-25 13:35:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:15,576 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 13:35:15,576 INFO L473 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-07-25 13:35:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 13:35:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:35:15,576 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:15,576 INFO L354 BasicCegarLoop]: trace histogram [195, 1, 1, 1] [2018-07-25 13:35:15,576 INFO L415 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1588114118, now seen corresponding path program 195 times [2018-07-25 13:35:15,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:16,699 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:16,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-07-25 13:35:16,699 INFO L451 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-07-25 13:35:16,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-07-25 13:35:16,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:35:16,705 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 198 states. [2018-07-25 13:35:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:17,728 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-07-25 13:35:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-07-25 13:35:17,728 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 198 [2018-07-25 13:35:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:17,728 INFO L225 Difference]: With dead ends: 202 [2018-07-25 13:35:17,728 INFO L226 Difference]: Without dead ends: 200 [2018-07-25 13:35:17,731 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:35:17,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-25 13:35:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-07-25 13:35:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-25 13:35:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-07-25 13:35:17,734 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 198 [2018-07-25 13:35:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:17,734 INFO L472 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-07-25 13:35:17,734 INFO L473 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-07-25 13:35:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-07-25 13:35:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-25 13:35:17,734 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:17,734 INFO L354 BasicCegarLoop]: trace histogram [196, 1, 1, 1] [2018-07-25 13:35:17,735 INFO L415 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1986893536, now seen corresponding path program 196 times [2018-07-25 13:35:17,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-07-25 13:35:18,928 INFO L451 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-07-25 13:35:18,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-07-25 13:35:18,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:35:18,933 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 199 states. [2018-07-25 13:35:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:19,950 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 13:35:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-07-25 13:35:19,950 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 199 [2018-07-25 13:35:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:19,951 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:35:19,951 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:35:19,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:35:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:35:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:35:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:35:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:35:19,957 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 199 [2018-07-25 13:35:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:19,958 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:35:19,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-07-25 13:35:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:35:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:35:19,959 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:19,959 INFO L354 BasicCegarLoop]: trace histogram [197, 1, 1, 1] [2018-07-25 13:35:19,959 INFO L415 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1464153606, now seen corresponding path program 197 times [2018-07-25 13:35:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:21,126 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:21,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-07-25 13:35:21,126 INFO L451 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-07-25 13:35:21,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-07-25 13:35:21,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:35:21,130 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 200 states. [2018-07-25 13:35:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:22,053 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-07-25 13:35:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-07-25 13:35:22,053 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 200 [2018-07-25 13:35:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:22,054 INFO L225 Difference]: With dead ends: 204 [2018-07-25 13:35:22,054 INFO L226 Difference]: Without dead ends: 202 [2018-07-25 13:35:22,057 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:35:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-25 13:35:22,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-07-25 13:35:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-07-25 13:35:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-07-25 13:35:22,061 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 200 [2018-07-25 13:35:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:22,061 INFO L472 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-07-25 13:35:22,062 INFO L473 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-07-25 13:35:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-07-25 13:35:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-07-25 13:35:22,062 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:22,063 INFO L354 BasicCegarLoop]: trace histogram [198, 1, 1, 1] [2018-07-25 13:35:22,063 INFO L415 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1855882336, now seen corresponding path program 198 times [2018-07-25 13:35:22,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:23,228 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:23,228 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-07-25 13:35:23,229 INFO L451 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-07-25 13:35:23,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-07-25 13:35:23,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:35:23,233 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 201 states. [2018-07-25 13:35:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:24,089 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:35:24,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-07-25 13:35:24,089 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 201 [2018-07-25 13:35:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:24,090 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:35:24,090 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:35:24,092 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:35:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:35:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:35:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:35:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 13:35:24,094 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 201 [2018-07-25 13:35:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:24,095 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 13:35:24,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-07-25 13:35:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 13:35:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:35:24,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:24,095 INFO L354 BasicCegarLoop]: trace histogram [199, 1, 1, 1] [2018-07-25 13:35:24,095 INFO L415 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:24,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1697781434, now seen corresponding path program 199 times [2018-07-25 13:35:24,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:25,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:25,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-07-25 13:35:25,227 INFO L451 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-07-25 13:35:25,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-07-25 13:35:25,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:35:25,230 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 202 states. [2018-07-25 13:35:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:26,013 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-07-25 13:35:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-07-25 13:35:26,013 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 202 [2018-07-25 13:35:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:26,014 INFO L225 Difference]: With dead ends: 206 [2018-07-25 13:35:26,014 INFO L226 Difference]: Without dead ends: 204 [2018-07-25 13:35:26,015 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:35:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-25 13:35:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-07-25 13:35:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-07-25 13:35:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-07-25 13:35:26,018 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 202 [2018-07-25 13:35:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:26,018 INFO L472 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-07-25 13:35:26,018 INFO L473 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-07-25 13:35:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-07-25 13:35:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-25 13:35:26,018 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:26,019 INFO L354 BasicCegarLoop]: trace histogram [200, 1, 1, 1] [2018-07-25 13:35:26,019 INFO L415 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:26,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1091620768, now seen corresponding path program 200 times [2018-07-25 13:35:26,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:27,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:27,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-07-25 13:35:27,099 INFO L451 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-07-25 13:35:27,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-07-25 13:35:27,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:35:27,103 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 203 states. [2018-07-25 13:35:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:27,919 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 13:35:27,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-07-25 13:35:27,919 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 203 [2018-07-25 13:35:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:27,920 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:35:27,920 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:35:27,922 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:35:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:35:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:35:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:35:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 13:35:27,925 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 203 [2018-07-25 13:35:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:27,925 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 13:35:27,925 INFO L473 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-07-25 13:35:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 13:35:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:35:27,926 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:27,926 INFO L354 BasicCegarLoop]: trace histogram [201, 1, 1, 1] [2018-07-25 13:35:27,926 INFO L415 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash 519490694, now seen corresponding path program 201 times [2018-07-25 13:35:27,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:29,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:29,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-07-25 13:35:29,186 INFO L451 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-07-25 13:35:29,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-07-25 13:35:29,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:35:29,190 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 204 states. [2018-07-25 13:35:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:30,057 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-07-25 13:35:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-07-25 13:35:30,057 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 204 [2018-07-25 13:35:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:30,058 INFO L225 Difference]: With dead ends: 208 [2018-07-25 13:35:30,058 INFO L226 Difference]: Without dead ends: 206 [2018-07-25 13:35:30,060 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:35:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-25 13:35:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-07-25 13:35:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-25 13:35:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-07-25 13:35:30,063 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 204 [2018-07-25 13:35:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:30,063 INFO L472 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-07-25 13:35:30,063 INFO L473 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-07-25 13:35:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-07-25 13:35:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-25 13:35:30,063 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:30,064 INFO L354 BasicCegarLoop]: trace histogram [202, 1, 1, 1] [2018-07-25 13:35:30,064 INFO L415 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:30,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1075661536, now seen corresponding path program 202 times [2018-07-25 13:35:30,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 20503 backedges. 0 proven. 20503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:31,236 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:31,236 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-07-25 13:35:31,237 INFO L451 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-07-25 13:35:31,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-07-25 13:35:31,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:35:31,242 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 205 states. [2018-07-25 13:35:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:32,346 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 13:35:32,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-07-25 13:35:32,346 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 205 [2018-07-25 13:35:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:32,346 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:35:32,346 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:35:32,349 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:35:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:35:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:35:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:35:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 13:35:32,352 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 205 [2018-07-25 13:35:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:32,352 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 13:35:32,352 INFO L473 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-07-25 13:35:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 13:35:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:35:32,353 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:32,353 INFO L354 BasicCegarLoop]: trace histogram [203, 1, 1, 1] [2018-07-25 13:35:32,353 INFO L415 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1014226886, now seen corresponding path program 203 times [2018-07-25 13:35:32,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:33,696 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:33,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-07-25 13:35:33,697 INFO L451 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-07-25 13:35:33,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-07-25 13:35:33,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:35:33,702 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 206 states. [2018-07-25 13:35:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:35,086 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-07-25 13:35:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-07-25 13:35:35,086 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 206 [2018-07-25 13:35:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:35,086 INFO L225 Difference]: With dead ends: 210 [2018-07-25 13:35:35,087 INFO L226 Difference]: Without dead ends: 208 [2018-07-25 13:35:35,089 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:35:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-07-25 13:35:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-07-25 13:35:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-25 13:35:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-07-25 13:35:35,093 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 206 [2018-07-25 13:35:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:35,093 INFO L472 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-07-25 13:35:35,093 INFO L473 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-07-25 13:35:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-07-25 13:35:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-25 13:35:35,094 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:35,094 INFO L354 BasicCegarLoop]: trace histogram [204, 1, 1, 1] [2018-07-25 13:35:35,094 INFO L415 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258528, now seen corresponding path program 204 times [2018-07-25 13:35:35,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 20910 backedges. 0 proven. 20910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:36,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:36,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-07-25 13:35:36,415 INFO L451 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-07-25 13:35:36,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-07-25 13:35:36,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:35:36,418 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 207 states. [2018-07-25 13:35:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:37,860 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 13:35:37,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-07-25 13:35:37,860 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 207 [2018-07-25 13:35:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:37,861 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:35:37,861 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:35:37,862 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:35:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:35:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:35:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:35:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 13:35:37,865 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 207 [2018-07-25 13:35:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:37,865 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 13:35:37,865 INFO L473 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-07-25 13:35:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 13:35:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:35:37,866 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:37,866 INFO L354 BasicCegarLoop]: trace histogram [205, 1, 1, 1] [2018-07-25 13:35:37,866 INFO L415 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash -285662458, now seen corresponding path program 205 times [2018-07-25 13:35:37,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:39,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:39,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-07-25 13:35:39,167 INFO L451 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-07-25 13:35:39,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-07-25 13:35:39,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:35:39,173 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 208 states. [2018-07-25 13:35:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:40,704 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-07-25 13:35:40,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-07-25 13:35:40,704 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 208 [2018-07-25 13:35:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:40,704 INFO L225 Difference]: With dead ends: 212 [2018-07-25 13:35:40,704 INFO L226 Difference]: Without dead ends: 210 [2018-07-25 13:35:40,707 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:35:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-25 13:35:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-07-25 13:35:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-07-25 13:35:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-07-25 13:35:40,710 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 208 [2018-07-25 13:35:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:40,710 INFO L472 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-07-25 13:35:40,710 INFO L473 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-07-25 13:35:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-07-25 13:35:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-07-25 13:35:40,711 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:40,711 INFO L354 BasicCegarLoop]: trace histogram [206, 1, 1, 1] [2018-07-25 13:35:40,711 INFO L415 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash -265605472, now seen corresponding path program 206 times [2018-07-25 13:35:40,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21321 backedges. 0 proven. 21321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:42,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:42,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-07-25 13:35:42,099 INFO L451 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-07-25 13:35:42,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-07-25 13:35:42,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:35:42,104 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 209 states. [2018-07-25 13:35:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:43,239 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 13:35:43,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-07-25 13:35:43,239 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 209 [2018-07-25 13:35:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:43,240 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:35:43,240 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:35:43,241 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:35:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:35:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:35:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:35:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 13:35:43,244 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 209 [2018-07-25 13:35:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:43,244 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 13:35:43,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-07-25 13:35:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 13:35:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:35:43,245 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:43,245 INFO L354 BasicCegarLoop]: trace histogram [207, 1, 1, 1] [2018-07-25 13:35:43,245 INFO L415 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:43,245 INFO L82 PathProgramCache]: Analyzing trace with hash 356161094, now seen corresponding path program 207 times [2018-07-25 13:35:43,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:44,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:44,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-07-25 13:35:44,435 INFO L451 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-07-25 13:35:44,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-07-25 13:35:44,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 13:35:44,441 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 210 states. [2018-07-25 13:35:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:45,266 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-07-25 13:35:45,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-07-25 13:35:45,266 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 210 [2018-07-25 13:35:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:45,267 INFO L225 Difference]: With dead ends: 214 [2018-07-25 13:35:45,267 INFO L226 Difference]: Without dead ends: 212 [2018-07-25 13:35:45,269 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 13:35:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-07-25 13:35:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-07-25 13:35:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-07-25 13:35:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-07-25 13:35:45,272 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 210 [2018-07-25 13:35:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:45,273 INFO L472 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-07-25 13:35:45,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-07-25 13:35:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-07-25 13:35:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-07-25 13:35:45,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:45,274 INFO L354 BasicCegarLoop]: trace histogram [208, 1, 1, 1] [2018-07-25 13:35:45,274 INFO L415 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1843911840, now seen corresponding path program 208 times [2018-07-25 13:35:45,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21736 backedges. 0 proven. 21736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:46,755 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:46,755 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-07-25 13:35:46,755 INFO L451 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-07-25 13:35:46,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-07-25 13:35:46,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:35:46,760 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 211 states. [2018-07-25 13:35:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:47,372 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 13:35:47,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-07-25 13:35:47,372 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 211 [2018-07-25 13:35:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:47,372 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:35:47,372 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:35:47,374 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:35:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:35:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:35:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:35:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 13:35:47,377 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 211 [2018-07-25 13:35:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:47,377 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 13:35:47,377 INFO L473 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-07-25 13:35:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 13:35:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:35:47,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:47,378 INFO L354 BasicCegarLoop]: trace histogram [209, 1, 1, 1] [2018-07-25 13:35:47,378 INFO L415 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:47,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1326696058, now seen corresponding path program 209 times [2018-07-25 13:35:47,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:48,671 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:48,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-07-25 13:35:48,671 INFO L451 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-07-25 13:35:48,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-07-25 13:35:48,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 13:35:48,676 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 212 states. [2018-07-25 13:35:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:49,362 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-07-25 13:35:49,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-07-25 13:35:49,362 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 212 [2018-07-25 13:35:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:49,363 INFO L225 Difference]: With dead ends: 216 [2018-07-25 13:35:49,363 INFO L226 Difference]: Without dead ends: 214 [2018-07-25 13:35:49,365 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 13:35:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-25 13:35:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-07-25 13:35:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-25 13:35:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-07-25 13:35:49,367 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 212 [2018-07-25 13:35:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:49,367 INFO L472 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-07-25 13:35:49,367 INFO L473 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-07-25 13:35:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-07-25 13:35:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-07-25 13:35:49,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:49,368 INFO L354 BasicCegarLoop]: trace histogram [210, 1, 1, 1] [2018-07-25 13:35:49,368 INFO L415 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1822091296, now seen corresponding path program 210 times [2018-07-25 13:35:49,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 22155 backedges. 0 proven. 22155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:50,767 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:50,767 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-07-25 13:35:50,767 INFO L451 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-07-25 13:35:50,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-07-25 13:35:50,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:35:50,773 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 213 states. [2018-07-25 13:35:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:51,840 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 13:35:51,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-07-25 13:35:51,841 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 213 [2018-07-25 13:35:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:51,841 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:35:51,841 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:35:51,843 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:35:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:35:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:35:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:35:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 13:35:51,846 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 213 [2018-07-25 13:35:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:51,846 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 13:35:51,846 INFO L473 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-07-25 13:35:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 13:35:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:35:51,847 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:51,847 INFO L354 BasicCegarLoop]: trace histogram [211, 1, 1, 1] [2018-07-25 13:35:51,847 INFO L415 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:51,847 INFO L82 PathProgramCache]: Analyzing trace with hash 650251462, now seen corresponding path program 211 times [2018-07-25 13:35:51,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:53,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:53,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-07-25 13:35:53,186 INFO L451 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-07-25 13:35:53,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-07-25 13:35:53,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:35:53,190 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 214 states. [2018-07-25 13:35:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:54,529 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-07-25 13:35:54,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-07-25 13:35:54,529 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 214 [2018-07-25 13:35:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:54,529 INFO L225 Difference]: With dead ends: 218 [2018-07-25 13:35:54,529 INFO L226 Difference]: Without dead ends: 216 [2018-07-25 13:35:54,531 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:35:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-07-25 13:35:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-07-25 13:35:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-07-25 13:35:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-07-25 13:35:54,533 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 214 [2018-07-25 13:35:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:54,533 INFO L472 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-07-25 13:35:54,534 INFO L473 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-07-25 13:35:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-07-25 13:35:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-07-25 13:35:54,534 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:54,534 INFO L354 BasicCegarLoop]: trace histogram [212, 1, 1, 1] [2018-07-25 13:35:54,534 INFO L415 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:54,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1317045024, now seen corresponding path program 212 times [2018-07-25 13:35:54,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22578 backedges. 0 proven. 22578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:55,839 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:55,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-07-25 13:35:55,839 INFO L451 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-07-25 13:35:55,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-07-25 13:35:55,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 13:35:55,845 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 215 states. [2018-07-25 13:35:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:56,620 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 13:35:56,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-07-25 13:35:56,620 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 215 [2018-07-25 13:35:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:56,621 INFO L225 Difference]: With dead ends: 219 [2018-07-25 13:35:56,621 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:35:56,623 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 13:35:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:35:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 13:35:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 13:35:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 13:35:56,626 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 215 [2018-07-25 13:35:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:56,626 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 13:35:56,626 INFO L473 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-07-25 13:35:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 13:35:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 13:35:56,627 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:56,627 INFO L354 BasicCegarLoop]: trace histogram [213, 1, 1, 1] [2018-07-25 13:35:56,627 INFO L415 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2121273350, now seen corresponding path program 213 times [2018-07-25 13:35:56,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:58,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:58,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-07-25 13:35:58,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-07-25 13:35:58,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-07-25 13:35:58,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 13:35:58,084 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 216 states. [2018-07-25 13:35:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:58,431 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-07-25 13:35:58,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-07-25 13:35:58,431 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 216 [2018-07-25 13:35:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:58,431 INFO L225 Difference]: With dead ends: 220 [2018-07-25 13:35:58,432 INFO L226 Difference]: Without dead ends: 218 [2018-07-25 13:35:58,433 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 13:35:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-25 13:35:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-07-25 13:35:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-25 13:35:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-07-25 13:35:58,435 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 216 [2018-07-25 13:35:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:58,435 INFO L472 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-07-25 13:35:58,435 INFO L473 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-07-25 13:35:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-07-25 13:35:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-25 13:35:58,436 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:58,436 INFO L354 BasicCegarLoop]: trace histogram [214, 1, 1, 1] [2018-07-25 13:35:58,436 INFO L415 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1334960544, now seen corresponding path program 214 times [2018-07-25 13:35:58,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 23005 backedges. 0 proven. 23005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:59,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:59,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-07-25 13:35:59,793 INFO L451 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-07-25 13:35:59,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-07-25 13:35:59,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:35:59,799 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 217 states. [2018-07-25 13:36:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:00,680 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 13:36:00,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-07-25 13:36:00,681 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 217 [2018-07-25 13:36:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:00,681 INFO L225 Difference]: With dead ends: 221 [2018-07-25 13:36:00,681 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:36:00,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:36:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:36:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 13:36:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 13:36:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 13:36:00,685 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 217 [2018-07-25 13:36:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:00,686 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 13:36:00,686 INFO L473 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-07-25 13:36:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 13:36:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 13:36:00,686 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:00,686 INFO L354 BasicCegarLoop]: trace histogram [215, 1, 1, 1] [2018-07-25 13:36:00,687 INFO L415 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1565899962, now seen corresponding path program 215 times [2018-07-25 13:36:00,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:02,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:02,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-07-25 13:36:02,142 INFO L451 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-07-25 13:36:02,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-07-25 13:36:02,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 13:36:02,145 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 218 states. [2018-07-25 13:36:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:03,513 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-07-25 13:36:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-07-25 13:36:03,513 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 218 [2018-07-25 13:36:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:03,513 INFO L225 Difference]: With dead ends: 222 [2018-07-25 13:36:03,513 INFO L226 Difference]: Without dead ends: 220 [2018-07-25 13:36:03,515 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 13:36:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-25 13:36:03,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-07-25 13:36:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-07-25 13:36:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-07-25 13:36:03,517 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 218 [2018-07-25 13:36:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:03,517 INFO L472 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-07-25 13:36:03,518 INFO L473 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-07-25 13:36:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-07-25 13:36:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-25 13:36:03,518 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:03,518 INFO L354 BasicCegarLoop]: trace histogram [216, 1, 1, 1] [2018-07-25 13:36:03,518 INFO L415 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1298262432, now seen corresponding path program 216 times [2018-07-25 13:36:03,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 23436 backedges. 0 proven. 23436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:04,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:04,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-07-25 13:36:04,957 INFO L451 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-07-25 13:36:04,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-07-25 13:36:04,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 13:36:04,964 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 219 states. [2018-07-25 13:36:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:06,083 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 13:36:06,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-07-25 13:36:06,084 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 219 [2018-07-25 13:36:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:06,084 INFO L225 Difference]: With dead ends: 223 [2018-07-25 13:36:06,084 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:36:06,087 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 13:36:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:36:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 13:36:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:36:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 13:36:06,090 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 219 [2018-07-25 13:36:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:06,090 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 13:36:06,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-07-25 13:36:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 13:36:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:36:06,091 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:06,091 INFO L354 BasicCegarLoop]: trace histogram [217, 1, 1, 1] [2018-07-25 13:36:06,091 INFO L415 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:06,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1591433594, now seen corresponding path program 217 times [2018-07-25 13:36:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:07,510 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:07,510 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-07-25 13:36:07,511 INFO L451 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-07-25 13:36:07,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-07-25 13:36:07,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 13:36:07,516 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 220 states. [2018-07-25 13:36:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:08,374 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-07-25 13:36:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-07-25 13:36:08,374 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 220 [2018-07-25 13:36:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:08,375 INFO L225 Difference]: With dead ends: 224 [2018-07-25 13:36:08,375 INFO L226 Difference]: Without dead ends: 222 [2018-07-25 13:36:08,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 13:36:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-07-25 13:36:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-07-25 13:36:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-25 13:36:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-07-25 13:36:08,378 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 220 [2018-07-25 13:36:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:08,378 INFO L472 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-07-25 13:36:08,378 INFO L473 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-07-25 13:36:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-07-25 13:36:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-07-25 13:36:08,379 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:08,379 INFO L354 BasicCegarLoop]: trace histogram [218, 1, 1, 1] [2018-07-25 13:36:08,379 INFO L415 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2089805024, now seen corresponding path program 218 times [2018-07-25 13:36:08,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 0 proven. 23871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:09,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:09,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-07-25 13:36:09,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-07-25 13:36:09,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-07-25 13:36:09,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-25 13:36:09,770 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 221 states. [2018-07-25 13:36:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:11,400 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 13:36:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-07-25 13:36:11,400 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 221 [2018-07-25 13:36:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:11,401 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:36:11,401 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:36:11,403 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-07-25 13:36:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:36:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 13:36:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 13:36:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 13:36:11,406 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 221 [2018-07-25 13:36:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:11,406 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 13:36:11,406 INFO L473 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-07-25 13:36:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 13:36:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 13:36:11,406 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:11,407 INFO L354 BasicCegarLoop]: trace histogram [219, 1, 1, 1] [2018-07-25 13:36:11,407 INFO L415 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash -359450170, now seen corresponding path program 219 times [2018-07-25 13:36:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:12,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:12,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-07-25 13:36:12,978 INFO L451 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-07-25 13:36:12,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-07-25 13:36:12,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-07-25 13:36:12,983 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 222 states. [2018-07-25 13:36:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:13,456 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-07-25 13:36:13,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-07-25 13:36:13,456 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 222 [2018-07-25 13:36:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:13,456 INFO L225 Difference]: With dead ends: 226 [2018-07-25 13:36:13,456 INFO L226 Difference]: Without dead ends: 224 [2018-07-25 13:36:13,459 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-07-25 13:36:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-25 13:36:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-07-25 13:36:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-25 13:36:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-07-25 13:36:13,463 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 222 [2018-07-25 13:36:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:13,464 INFO L472 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-07-25 13:36:13,464 INFO L473 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-07-25 13:36:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-07-25 13:36:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-25 13:36:13,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:13,465 INFO L354 BasicCegarLoop]: trace histogram [220, 1, 1, 1] [2018-07-25 13:36:13,465 INFO L415 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1741942752, now seen corresponding path program 220 times [2018-07-25 13:36:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 24310 backedges. 0 proven. 24310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:15,014 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:15,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [222] total 222 [2018-07-25 13:36:15,015 INFO L451 AbstractCegarLoop]: Interpolant automaton has 223 states [2018-07-25 13:36:15,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2018-07-25 13:36:15,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-07-25 13:36:15,020 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 223 states. [2018-07-25 13:36:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:16,003 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 13:36:16,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-07-25 13:36:16,004 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 223 [2018-07-25 13:36:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:16,004 INFO L225 Difference]: With dead ends: 227 [2018-07-25 13:36:16,004 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:36:16,006 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-07-25 13:36:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:36:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 13:36:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:36:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 13:36:16,009 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 223 [2018-07-25 13:36:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:16,009 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 13:36:16,009 INFO L473 AbstractCegarLoop]: Interpolant automaton has 223 states. [2018-07-25 13:36:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 13:36:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 13:36:16,010 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:16,010 INFO L354 BasicCegarLoop]: trace histogram [221, 1, 1, 1] [2018-07-25 13:36:16,010 INFO L415 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1834353402, now seen corresponding path program 221 times [2018-07-25 13:36:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:17,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:17,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-07-25 13:36:17,637 INFO L451 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-07-25 13:36:17,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-07-25 13:36:17,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-07-25 13:36:17,642 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 224 states. [2018-07-25 13:36:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:19,162 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-07-25 13:36:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-07-25 13:36:19,163 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 224 [2018-07-25 13:36:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:19,163 INFO L225 Difference]: With dead ends: 228 [2018-07-25 13:36:19,163 INFO L226 Difference]: Without dead ends: 226 [2018-07-25 13:36:19,165 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-07-25 13:36:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-25 13:36:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-07-25 13:36:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-07-25 13:36:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-07-25 13:36:19,168 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 224 [2018-07-25 13:36:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:19,168 INFO L472 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-07-25 13:36:19,168 INFO L473 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-07-25 13:36:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-07-25 13:36:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-25 13:36:19,169 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:19,169 INFO L354 BasicCegarLoop]: trace histogram [222, 1, 1, 1] [2018-07-25 13:36:19,169 INFO L415 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:19,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1030384480, now seen corresponding path program 222 times [2018-07-25 13:36:19,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24753 backedges. 0 proven. 24753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:20,668 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:20,668 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [224] total 224 [2018-07-25 13:36:20,668 INFO L451 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-07-25 13:36:20,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-07-25 13:36:20,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-07-25 13:36:20,674 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 225 states. [2018-07-25 13:36:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:21,588 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 13:36:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-07-25 13:36:21,588 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 225 [2018-07-25 13:36:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:21,588 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:36:21,588 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:36:21,590 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-07-25 13:36:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:36:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 13:36:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:36:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 13:36:21,593 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 225 [2018-07-25 13:36:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:21,593 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 13:36:21,593 INFO L473 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-07-25 13:36:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 13:36:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 13:36:21,594 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:21,594 INFO L354 BasicCegarLoop]: trace histogram [223, 1, 1, 1] [2018-07-25 13:36:21,594 INFO L415 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1877151674, now seen corresponding path program 223 times [2018-07-25 13:36:21,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:23,164 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:23,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [225] total 225 [2018-07-25 13:36:23,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-07-25 13:36:23,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-07-25 13:36:23,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-07-25 13:36:23,167 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 226 states. [2018-07-25 13:36:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:24,697 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-07-25 13:36:24,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-07-25 13:36:24,697 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 226 [2018-07-25 13:36:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:24,697 INFO L225 Difference]: With dead ends: 230 [2018-07-25 13:36:24,697 INFO L226 Difference]: Without dead ends: 228 [2018-07-25 13:36:24,698 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-07-25 13:36:24,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-07-25 13:36:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-07-25 13:36:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-07-25 13:36:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-07-25 13:36:24,701 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 226 [2018-07-25 13:36:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:24,701 INFO L472 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-07-25 13:36:24,702 INFO L473 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-07-25 13:36:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-07-25 13:36:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-25 13:36:24,702 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:24,702 INFO L354 BasicCegarLoop]: trace histogram [224, 1, 1, 1] [2018-07-25 13:36:24,702 INFO L415 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:24,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1937836384, now seen corresponding path program 224 times [2018-07-25 13:36:24,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 25200 backedges. 0 proven. 25200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:26,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:26,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [226] total 226 [2018-07-25 13:36:26,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 227 states [2018-07-25 13:36:26,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 227 interpolants. [2018-07-25 13:36:26,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-07-25 13:36:26,311 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 227 states. [2018-07-25 13:36:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:26,730 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 13:36:26,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-07-25 13:36:26,730 INFO L78 Accepts]: Start accepts. Automaton has 227 states. Word has length 227 [2018-07-25 13:36:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:26,731 INFO L225 Difference]: With dead ends: 231 [2018-07-25 13:36:26,731 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:36:26,733 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-07-25 13:36:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:36:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 13:36:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 13:36:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 13:36:26,735 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 227 [2018-07-25 13:36:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:26,736 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 13:36:26,736 INFO L473 AbstractCegarLoop]: Interpolant automaton has 227 states. [2018-07-25 13:36:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 13:36:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 13:36:26,736 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:26,736 INFO L354 BasicCegarLoop]: trace histogram [225, 1, 1, 1] [2018-07-25 13:36:26,736 INFO L415 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash -56618106, now seen corresponding path program 225 times [2018-07-25 13:36:26,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:28,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:28,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-07-25 13:36:28,448 INFO L451 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-07-25 13:36:28,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-07-25 13:36:28,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-07-25 13:36:28,451 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 228 states. [2018-07-25 13:36:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:30,139 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-07-25 13:36:30,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-07-25 13:36:30,139 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 228 [2018-07-25 13:36:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:30,140 INFO L225 Difference]: With dead ends: 232 [2018-07-25 13:36:30,140 INFO L226 Difference]: Without dead ends: 230 [2018-07-25 13:36:30,141 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-07-25 13:36:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-25 13:36:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-07-25 13:36:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-25 13:36:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-07-25 13:36:30,144 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 228 [2018-07-25 13:36:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:30,144 INFO L472 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-07-25 13:36:30,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-07-25 13:36:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-07-25 13:36:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-07-25 13:36:30,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:30,145 INFO L354 BasicCegarLoop]: trace histogram [226, 1, 1, 1] [2018-07-25 13:36:30,145 INFO L415 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1755165152, now seen corresponding path program 226 times [2018-07-25 13:36:30,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 25651 backedges. 0 proven. 25651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:31,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:31,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [228] total 228 [2018-07-25 13:36:31,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 229 states [2018-07-25 13:36:31,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 229 interpolants. [2018-07-25 13:36:31,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-07-25 13:36:31,696 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 229 states. [2018-07-25 13:36:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:32,700 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 13:36:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-07-25 13:36:32,700 INFO L78 Accepts]: Start accepts. Automaton has 229 states. Word has length 229 [2018-07-25 13:36:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:32,700 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:36:32,700 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:36:32,703 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-07-25 13:36:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:36:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 13:36:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:36:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 13:36:32,706 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 229 [2018-07-25 13:36:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:32,706 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 13:36:32,706 INFO L473 AbstractCegarLoop]: Interpolant automaton has 229 states. [2018-07-25 13:36:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 13:36:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:36:32,707 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:32,707 INFO L354 BasicCegarLoop]: trace histogram [227, 1, 1, 1] [2018-07-25 13:36:32,707 INFO L415 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1424451270, now seen corresponding path program 227 times [2018-07-25 13:36:32,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:34,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:34,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [229] total 229 [2018-07-25 13:36:34,392 INFO L451 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-07-25 13:36:34,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-07-25 13:36:34,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-07-25 13:36:34,396 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 230 states. [2018-07-25 13:36:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:36,374 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-07-25 13:36:36,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-07-25 13:36:36,374 INFO L78 Accepts]: Start accepts. Automaton has 230 states. Word has length 230 [2018-07-25 13:36:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:36,375 INFO L225 Difference]: With dead ends: 234 [2018-07-25 13:36:36,375 INFO L226 Difference]: Without dead ends: 232 [2018-07-25 13:36:36,377 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-07-25 13:36:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-07-25 13:36:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-07-25 13:36:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-25 13:36:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-07-25 13:36:36,380 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 230 [2018-07-25 13:36:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:36,380 INFO L472 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-07-25 13:36:36,380 INFO L473 AbstractCegarLoop]: Interpolant automaton has 230 states. [2018-07-25 13:36:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-07-25 13:36:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-25 13:36:36,381 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:36,381 INFO L354 BasicCegarLoop]: trace histogram [228, 1, 1, 1] [2018-07-25 13:36:36,381 INFO L415 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:36,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1208312544, now seen corresponding path program 228 times [2018-07-25 13:36:36,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 26106 backedges. 0 proven. 26106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:38,090 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:38,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [230] total 230 [2018-07-25 13:36:38,090 INFO L451 AbstractCegarLoop]: Interpolant automaton has 231 states [2018-07-25 13:36:38,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 231 interpolants. [2018-07-25 13:36:38,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-07-25 13:36:38,098 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 231 states. [2018-07-25 13:36:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:38,702 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 13:36:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-07-25 13:36:38,702 INFO L78 Accepts]: Start accepts. Automaton has 231 states. Word has length 231 [2018-07-25 13:36:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:38,703 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:36:38,703 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:36:38,706 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-07-25 13:36:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:36:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 13:36:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:36:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 13:36:38,709 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 231 [2018-07-25 13:36:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:38,709 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 13:36:38,709 INFO L473 AbstractCegarLoop]: Interpolant automaton has 231 states. [2018-07-25 13:36:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 13:36:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 13:36:38,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:38,710 INFO L354 BasicCegarLoop]: trace histogram [229, 1, 1, 1] [2018-07-25 13:36:38,710 INFO L415 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1197020666, now seen corresponding path program 229 times [2018-07-25 13:36:38,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 26335 backedges. 0 proven. 26335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:40,411 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:40,411 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [231] total 231 [2018-07-25 13:36:40,412 INFO L451 AbstractCegarLoop]: Interpolant automaton has 232 states [2018-07-25 13:36:40,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 232 interpolants. [2018-07-25 13:36:40,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-07-25 13:36:40,415 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 232 states. [2018-07-25 13:36:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:42,126 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-07-25 13:36:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-07-25 13:36:42,126 INFO L78 Accepts]: Start accepts. Automaton has 232 states. Word has length 232 [2018-07-25 13:36:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:42,126 INFO L225 Difference]: With dead ends: 236 [2018-07-25 13:36:42,127 INFO L226 Difference]: Without dead ends: 234 [2018-07-25 13:36:42,129 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-07-25 13:36:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-25 13:36:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-07-25 13:36:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-07-25 13:36:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-07-25 13:36:42,131 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 232 [2018-07-25 13:36:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:42,132 INFO L472 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-07-25 13:36:42,132 INFO L473 AbstractCegarLoop]: Interpolant automaton has 232 states. [2018-07-25 13:36:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-07-25 13:36:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-07-25 13:36:42,132 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:42,132 INFO L354 BasicCegarLoop]: trace histogram [230, 1, 1, 1] [2018-07-25 13:36:42,133 INFO L415 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:42,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1547061152, now seen corresponding path program 230 times [2018-07-25 13:36:42,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 26565 backedges. 0 proven. 26565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:43,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:43,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [232] total 232 [2018-07-25 13:36:43,757 INFO L451 AbstractCegarLoop]: Interpolant automaton has 233 states [2018-07-25 13:36:43,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 233 interpolants. [2018-07-25 13:36:43,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-07-25 13:36:43,762 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 233 states. [2018-07-25 13:36:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:45,068 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 13:36:45,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-07-25 13:36:45,068 INFO L78 Accepts]: Start accepts. Automaton has 233 states. Word has length 233 [2018-07-25 13:36:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:45,069 INFO L225 Difference]: With dead ends: 237 [2018-07-25 13:36:45,069 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 13:36:45,071 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-07-25 13:36:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 13:36:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 13:36:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:36:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 13:36:45,074 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 233 [2018-07-25 13:36:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:45,074 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 13:36:45,074 INFO L473 AbstractCegarLoop]: Interpolant automaton has 233 states. [2018-07-25 13:36:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 13:36:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 13:36:45,075 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:45,075 INFO L354 BasicCegarLoop]: trace histogram [231, 1, 1, 1] [2018-07-25 13:36:45,075 INFO L415 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash 714251590, now seen corresponding path program 231 times [2018-07-25 13:36:45,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 26796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:46,835 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:46,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [233] total 233 [2018-07-25 13:36:46,835 INFO L451 AbstractCegarLoop]: Interpolant automaton has 234 states [2018-07-25 13:36:46,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2018-07-25 13:36:46,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-07-25 13:36:46,840 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 234 states. [2018-07-25 13:36:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:47,622 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-07-25 13:36:47,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-07-25 13:36:47,622 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 234 [2018-07-25 13:36:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:47,623 INFO L225 Difference]: With dead ends: 238 [2018-07-25 13:36:47,623 INFO L226 Difference]: Without dead ends: 236 [2018-07-25 13:36:47,626 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-07-25 13:36:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-07-25 13:36:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-07-25 13:36:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-25 13:36:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-07-25 13:36:47,628 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 234 [2018-07-25 13:36:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:47,629 INFO L472 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-07-25 13:36:47,629 INFO L473 AbstractCegarLoop]: Interpolant automaton has 234 states. [2018-07-25 13:36:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-07-25 13:36:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-07-25 13:36:47,629 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:47,629 INFO L354 BasicCegarLoop]: trace histogram [232, 1, 1, 1] [2018-07-25 13:36:47,630 INFO L415 AbstractCegarLoop]: === Iteration 233 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash 666958944, now seen corresponding path program 232 times [2018-07-25 13:36:47,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 27028 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:49,396 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:49,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [234] total 234 [2018-07-25 13:36:49,396 INFO L451 AbstractCegarLoop]: Interpolant automaton has 235 states [2018-07-25 13:36:49,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 235 interpolants. [2018-07-25 13:36:49,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-07-25 13:36:49,402 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 235 states. [2018-07-25 13:36:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:51,067 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 13:36:51,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-07-25 13:36:51,067 INFO L78 Accepts]: Start accepts. Automaton has 235 states. Word has length 235 [2018-07-25 13:36:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:51,068 INFO L225 Difference]: With dead ends: 239 [2018-07-25 13:36:51,068 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 13:36:51,070 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-07-25 13:36:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 13:36:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 13:36:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 13:36:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 13:36:51,073 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 235 [2018-07-25 13:36:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:51,073 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 13:36:51,073 INFO L473 AbstractCegarLoop]: Interpolant automaton has 235 states. [2018-07-25 13:36:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 13:36:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 13:36:51,074 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:51,074 INFO L354 BasicCegarLoop]: trace histogram [233, 1, 1, 1] [2018-07-25 13:36:51,074 INFO L415 AbstractCegarLoop]: === Iteration 234 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash -799113082, now seen corresponding path program 233 times [2018-07-25 13:36:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 27261 backedges. 0 proven. 27261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:52,872 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:52,872 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [235] total 235 [2018-07-25 13:36:52,873 INFO L451 AbstractCegarLoop]: Interpolant automaton has 236 states [2018-07-25 13:36:52,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 236 interpolants. [2018-07-25 13:36:52,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-07-25 13:36:52,879 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 236 states. [2018-07-25 13:36:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:54,084 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-07-25 13:36:54,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2018-07-25 13:36:54,084 INFO L78 Accepts]: Start accepts. Automaton has 236 states. Word has length 236 [2018-07-25 13:36:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:54,084 INFO L225 Difference]: With dead ends: 240 [2018-07-25 13:36:54,085 INFO L226 Difference]: Without dead ends: 238 [2018-07-25 13:36:54,087 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-07-25 13:36:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-07-25 13:36:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-07-25 13:36:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-07-25 13:36:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-07-25 13:36:54,090 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 236 [2018-07-25 13:36:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:54,090 INFO L472 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-07-25 13:36:54,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 236 states. [2018-07-25 13:36:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-07-25 13:36:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-07-25 13:36:54,091 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:54,091 INFO L354 BasicCegarLoop]: trace histogram [234, 1, 1, 1] [2018-07-25 13:36:54,091 INFO L415 AbstractCegarLoop]: === Iteration 235 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash 997294368, now seen corresponding path program 234 times [2018-07-25 13:36:54,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 27495 backedges. 0 proven. 27495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:55,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:55,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [236] total 236 [2018-07-25 13:36:55,839 INFO L451 AbstractCegarLoop]: Interpolant automaton has 237 states [2018-07-25 13:36:55,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2018-07-25 13:36:55,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-07-25 13:36:55,846 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 237 states. [2018-07-25 13:36:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:56,811 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 13:36:56,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2018-07-25 13:36:56,812 INFO L78 Accepts]: Start accepts. Automaton has 237 states. Word has length 237 [2018-07-25 13:36:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:56,812 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:36:56,812 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:36:56,813 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-07-25 13:36:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:36:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 13:36:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 13:36:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 13:36:56,816 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 237 [2018-07-25 13:36:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:56,816 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 13:36:56,816 INFO L473 AbstractCegarLoop]: Interpolant automaton has 237 states. [2018-07-25 13:36:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 13:36:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 13:36:56,817 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:56,817 INFO L354 BasicCegarLoop]: trace histogram [235, 1, 1, 1] [2018-07-25 13:36:56,817 INFO L415 AbstractCegarLoop]: === Iteration 236 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash 851350470, now seen corresponding path program 235 times [2018-07-25 13:36:56,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27730 backedges. 0 proven. 27730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:58,730 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:58,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [237] total 237 [2018-07-25 13:36:58,730 INFO L451 AbstractCegarLoop]: Interpolant automaton has 238 states [2018-07-25 13:36:58,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 238 interpolants. [2018-07-25 13:36:58,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-07-25 13:36:58,737 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 238 states. [2018-07-25 13:37:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:00,787 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-07-25 13:37:00,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2018-07-25 13:37:00,787 INFO L78 Accepts]: Start accepts. Automaton has 238 states. Word has length 238 [2018-07-25 13:37:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:00,788 INFO L225 Difference]: With dead ends: 242 [2018-07-25 13:37:00,788 INFO L226 Difference]: Without dead ends: 240 [2018-07-25 13:37:00,791 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-07-25 13:37:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-07-25 13:37:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-07-25 13:37:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-07-25 13:37:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-07-25 13:37:00,794 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 238 [2018-07-25 13:37:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:00,794 INFO L472 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-07-25 13:37:00,794 INFO L473 AbstractCegarLoop]: Interpolant automaton has 238 states. [2018-07-25 13:37:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-07-25 13:37:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-07-25 13:37:00,795 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:00,795 INFO L354 BasicCegarLoop]: trace histogram [236, 1, 1, 1] [2018-07-25 13:37:00,795 INFO L415 AbstractCegarLoop]: === Iteration 237 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash 622056928, now seen corresponding path program 236 times [2018-07-25 13:37:00,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 27966 backedges. 0 proven. 27966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:02,650 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:02,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [238] total 238 [2018-07-25 13:37:02,651 INFO L451 AbstractCegarLoop]: Interpolant automaton has 239 states [2018-07-25 13:37:02,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 239 interpolants. [2018-07-25 13:37:02,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-07-25 13:37:02,656 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 239 states. [2018-07-25 13:37:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:04,161 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 13:37:04,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2018-07-25 13:37:04,161 INFO L78 Accepts]: Start accepts. Automaton has 239 states. Word has length 239 [2018-07-25 13:37:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:04,162 INFO L225 Difference]: With dead ends: 243 [2018-07-25 13:37:04,162 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 13:37:04,163 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-07-25 13:37:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 13:37:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 13:37:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:37:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 13:37:04,166 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 239 [2018-07-25 13:37:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:04,166 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 13:37:04,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 239 states. [2018-07-25 13:37:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 13:37:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:37:04,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:04,167 INFO L354 BasicCegarLoop]: trace histogram [237, 1, 1, 1] [2018-07-25 13:37:04,167 INFO L415 AbstractCegarLoop]: === Iteration 238 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2103891718, now seen corresponding path program 237 times [2018-07-25 13:37:04,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 28203 backedges. 0 proven. 28203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:06,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:06,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [239] total 239 [2018-07-25 13:37:06,004 INFO L451 AbstractCegarLoop]: Interpolant automaton has 240 states [2018-07-25 13:37:06,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 240 interpolants. [2018-07-25 13:37:06,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-07-25 13:37:06,012 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 240 states. [2018-07-25 13:37:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:07,057 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-07-25 13:37:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2018-07-25 13:37:07,057 INFO L78 Accepts]: Start accepts. Automaton has 240 states. Word has length 240 [2018-07-25 13:37:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:07,058 INFO L225 Difference]: With dead ends: 244 [2018-07-25 13:37:07,058 INFO L226 Difference]: Without dead ends: 242 [2018-07-25 13:37:07,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-07-25 13:37:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-25 13:37:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-07-25 13:37:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-07-25 13:37:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-07-25 13:37:07,064 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 240 [2018-07-25 13:37:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:07,064 INFO L472 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-07-25 13:37:07,064 INFO L473 AbstractCegarLoop]: Interpolant automaton has 240 states. [2018-07-25 13:37:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-07-25 13:37:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-07-25 13:37:07,065 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:07,065 INFO L354 BasicCegarLoop]: trace histogram [238, 1, 1, 1] [2018-07-25 13:37:07,065 INFO L415 AbstractCegarLoop]: === Iteration 239 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash 796129952, now seen corresponding path program 238 times [2018-07-25 13:37:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28441 backedges. 0 proven. 28441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:08,911 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:08,911 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [240] total 240 [2018-07-25 13:37:08,912 INFO L451 AbstractCegarLoop]: Interpolant automaton has 241 states [2018-07-25 13:37:08,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 241 interpolants. [2018-07-25 13:37:08,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-07-25 13:37:08,919 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 241 states. [2018-07-25 13:37:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:10,991 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 13:37:10,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-07-25 13:37:10,991 INFO L78 Accepts]: Start accepts. Automaton has 241 states. Word has length 241 [2018-07-25 13:37:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:10,992 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:37:10,992 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 13:37:10,994 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-07-25 13:37:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 13:37:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 13:37:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 13:37:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 13:37:10,996 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 241 [2018-07-25 13:37:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:10,997 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 13:37:10,997 INFO L473 AbstractCegarLoop]: Interpolant automaton has 241 states. [2018-07-25 13:37:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 13:37:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 13:37:10,997 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:10,997 INFO L354 BasicCegarLoop]: trace histogram [239, 1, 1, 1] [2018-07-25 13:37:10,998 INFO L415 AbstractCegarLoop]: === Iteration 240 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:10,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1089779130, now seen corresponding path program 239 times [2018-07-25 13:37:10,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 28680 backedges. 0 proven. 28680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:12,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:12,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [241] total 241 [2018-07-25 13:37:12,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 242 states [2018-07-25 13:37:12,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2018-07-25 13:37:12,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-07-25 13:37:12,894 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 242 states. [2018-07-25 13:37:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:14,685 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-07-25 13:37:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-07-25 13:37:14,685 INFO L78 Accepts]: Start accepts. Automaton has 242 states. Word has length 242 [2018-07-25 13:37:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:14,686 INFO L225 Difference]: With dead ends: 246 [2018-07-25 13:37:14,686 INFO L226 Difference]: Without dead ends: 244 [2018-07-25 13:37:14,690 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-07-25 13:37:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-07-25 13:37:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-07-25 13:37:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-07-25 13:37:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-07-25 13:37:14,694 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 242 [2018-07-25 13:37:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:14,694 INFO L472 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-07-25 13:37:14,694 INFO L473 AbstractCegarLoop]: Interpolant automaton has 242 states. [2018-07-25 13:37:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-07-25 13:37:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-07-25 13:37:14,695 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:14,695 INFO L354 BasicCegarLoop]: trace histogram [240, 1, 1, 1] [2018-07-25 13:37:14,695 INFO L415 AbstractCegarLoop]: === Iteration 241 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash 576581472, now seen corresponding path program 240 times [2018-07-25 13:37:14,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 28920 backedges. 0 proven. 28920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:16,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:16,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [242] total 242 [2018-07-25 13:37:16,626 INFO L451 AbstractCegarLoop]: Interpolant automaton has 243 states [2018-07-25 13:37:16,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2018-07-25 13:37:16,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-07-25 13:37:16,635 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 243 states. [2018-07-25 13:37:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:17,334 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 13:37:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-07-25 13:37:17,334 INFO L78 Accepts]: Start accepts. Automaton has 243 states. Word has length 243 [2018-07-25 13:37:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:17,335 INFO L225 Difference]: With dead ends: 247 [2018-07-25 13:37:17,335 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 13:37:17,337 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-07-25 13:37:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 13:37:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 13:37:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:37:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 13:37:17,340 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 243 [2018-07-25 13:37:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:17,340 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 13:37:17,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 243 states. [2018-07-25 13:37:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 13:37:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 13:37:17,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:17,341 INFO L354 BasicCegarLoop]: trace histogram [241, 1, 1, 1] [2018-07-25 13:37:17,341 INFO L415 AbstractCegarLoop]: === Iteration 242 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash 694152582, now seen corresponding path program 241 times [2018-07-25 13:37:17,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 29161 backedges. 0 proven. 29161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:19,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:19,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [243] total 243 [2018-07-25 13:37:19,208 INFO L451 AbstractCegarLoop]: Interpolant automaton has 244 states [2018-07-25 13:37:19,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 244 interpolants. [2018-07-25 13:37:19,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-07-25 13:37:19,212 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 244 states. [2018-07-25 13:37:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:20,807 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-07-25 13:37:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2018-07-25 13:37:20,807 INFO L78 Accepts]: Start accepts. Automaton has 244 states. Word has length 244 [2018-07-25 13:37:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:20,808 INFO L225 Difference]: With dead ends: 248 [2018-07-25 13:37:20,808 INFO L226 Difference]: Without dead ends: 246 [2018-07-25 13:37:20,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-07-25 13:37:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-07-25 13:37:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-07-25 13:37:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-25 13:37:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-07-25 13:37:20,814 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 244 [2018-07-25 13:37:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:20,814 INFO L472 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-07-25 13:37:20,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 244 states. [2018-07-25 13:37:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-07-25 13:37:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-07-25 13:37:20,815 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:20,815 INFO L354 BasicCegarLoop]: trace histogram [242, 1, 1, 1] [2018-07-25 13:37:20,815 INFO L415 AbstractCegarLoop]: === Iteration 243 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash 43889696, now seen corresponding path program 242 times [2018-07-25 13:37:20,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 29403 backedges. 0 proven. 29403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:22,799 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:22,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [244] total 244 [2018-07-25 13:37:22,800 INFO L451 AbstractCegarLoop]: Interpolant automaton has 245 states [2018-07-25 13:37:22,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2018-07-25 13:37:22,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29890, Invalid=29890, Unknown=0, NotChecked=0, Total=59780 [2018-07-25 13:37:22,808 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 245 states. [2018-07-25 13:37:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:24,312 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 13:37:24,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2018-07-25 13:37:24,313 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 245 [2018-07-25 13:37:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:24,313 INFO L225 Difference]: With dead ends: 249 [2018-07-25 13:37:24,313 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 13:37:24,316 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29890, Invalid=29890, Unknown=0, NotChecked=0, Total=59780 [2018-07-25 13:37:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 13:37:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 13:37:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 13:37:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 13:37:24,319 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 245 [2018-07-25 13:37:24,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:24,319 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 13:37:24,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 245 states. [2018-07-25 13:37:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 13:37:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 13:37:24,320 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:24,320 INFO L354 BasicCegarLoop]: trace histogram [243, 1, 1, 1] [2018-07-25 13:37:24,320 INFO L415 AbstractCegarLoop]: === Iteration 244 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1360576710, now seen corresponding path program 243 times [2018-07-25 13:37:24,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 29646 backedges. 0 proven. 29646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:26,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:26,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [245] total 245 [2018-07-25 13:37:26,149 INFO L451 AbstractCegarLoop]: Interpolant automaton has 246 states [2018-07-25 13:37:26,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2018-07-25 13:37:26,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30135, Invalid=30135, Unknown=0, NotChecked=0, Total=60270 [2018-07-25 13:37:26,156 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 246 states. [2018-07-25 13:37:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:28,380 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-07-25 13:37:28,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2018-07-25 13:37:28,380 INFO L78 Accepts]: Start accepts. Automaton has 246 states. Word has length 246 [2018-07-25 13:37:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:28,380 INFO L225 Difference]: With dead ends: 250 [2018-07-25 13:37:28,380 INFO L226 Difference]: Without dead ends: 248 [2018-07-25 13:37:28,383 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30135, Invalid=30135, Unknown=0, NotChecked=0, Total=60270 [2018-07-25 13:37:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-07-25 13:37:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-07-25 13:37:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-07-25 13:37:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-07-25 13:37:28,386 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 246 [2018-07-25 13:37:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:28,386 INFO L472 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-07-25 13:37:28,386 INFO L473 AbstractCegarLoop]: Interpolant automaton has 246 states. [2018-07-25 13:37:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-07-25 13:37:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-07-25 13:37:28,387 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:28,387 INFO L354 BasicCegarLoop]: trace histogram [244, 1, 1, 1] [2018-07-25 13:37:28,387 INFO L415 AbstractCegarLoop]: === Iteration 245 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -771798816, now seen corresponding path program 244 times [2018-07-25 13:37:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 29890 backedges. 0 proven. 29890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:30,466 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:30,467 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [246] total 246 [2018-07-25 13:37:30,467 INFO L451 AbstractCegarLoop]: Interpolant automaton has 247 states [2018-07-25 13:37:30,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 247 interpolants. [2018-07-25 13:37:30,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30381, Invalid=30381, Unknown=0, NotChecked=0, Total=60762 [2018-07-25 13:37:30,471 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 247 states. [2018-07-25 13:37:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:32,288 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-25 13:37:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2018-07-25 13:37:32,288 INFO L78 Accepts]: Start accepts. Automaton has 247 states. Word has length 247 [2018-07-25 13:37:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:32,289 INFO L225 Difference]: With dead ends: 251 [2018-07-25 13:37:32,289 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:37:32,290 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30381, Invalid=30381, Unknown=0, NotChecked=0, Total=60762 [2018-07-25 13:37:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:37:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 13:37:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 13:37:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-25 13:37:32,293 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 247 [2018-07-25 13:37:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:32,293 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-25 13:37:32,293 INFO L473 AbstractCegarLoop]: Interpolant automaton has 247 states. [2018-07-25 13:37:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-25 13:37:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 13:37:32,294 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:32,294 INFO L354 BasicCegarLoop]: trace histogram [245, 1, 1, 1] [2018-07-25 13:37:32,294 INFO L415 AbstractCegarLoop]: === Iteration 246 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1844036614, now seen corresponding path program 245 times [2018-07-25 13:37:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30135 backedges. 0 proven. 30135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:34,414 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:34,414 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [247] total 247 [2018-07-25 13:37:34,414 INFO L451 AbstractCegarLoop]: Interpolant automaton has 248 states [2018-07-25 13:37:34,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2018-07-25 13:37:34,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30628, Invalid=30628, Unknown=0, NotChecked=0, Total=61256 [2018-07-25 13:37:34,421 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 248 states. [2018-07-25 13:37:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:35,678 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-07-25 13:37:35,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-07-25 13:37:35,678 INFO L78 Accepts]: Start accepts. Automaton has 248 states. Word has length 248 [2018-07-25 13:37:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:35,678 INFO L225 Difference]: With dead ends: 252 [2018-07-25 13:37:35,678 INFO L226 Difference]: Without dead ends: 250 [2018-07-25 13:37:35,681 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30628, Invalid=30628, Unknown=0, NotChecked=0, Total=61256 [2018-07-25 13:37:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-07-25 13:37:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-07-25 13:37:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-07-25 13:37:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-07-25 13:37:35,684 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 248 [2018-07-25 13:37:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:35,684 INFO L472 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-07-25 13:37:35,684 INFO L473 AbstractCegarLoop]: Interpolant automaton has 248 states. [2018-07-25 13:37:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-07-25 13:37:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-07-25 13:37:35,684 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:35,685 INFO L354 BasicCegarLoop]: trace histogram [246, 1, 1, 1] [2018-07-25 13:37:35,685 INFO L415 AbstractCegarLoop]: === Iteration 247 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:35,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1330556320, now seen corresponding path program 246 times [2018-07-25 13:37:35,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30381 backedges. 0 proven. 30381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:37,627 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:37,627 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [248] total 248 [2018-07-25 13:37:37,627 INFO L451 AbstractCegarLoop]: Interpolant automaton has 249 states [2018-07-25 13:37:37,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 249 interpolants. [2018-07-25 13:37:37,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30876, Invalid=30876, Unknown=0, NotChecked=0, Total=61752 [2018-07-25 13:37:37,633 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 249 states. [2018-07-25 13:37:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:39,190 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-25 13:37:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2018-07-25 13:37:39,190 INFO L78 Accepts]: Start accepts. Automaton has 249 states. Word has length 249 [2018-07-25 13:37:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:39,191 INFO L225 Difference]: With dead ends: 253 [2018-07-25 13:37:39,191 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 13:37:39,194 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30876, Invalid=30876, Unknown=0, NotChecked=0, Total=61752 [2018-07-25 13:37:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 13:37:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 13:37:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:37:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 13:37:39,197 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 249 [2018-07-25 13:37:39,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:39,197 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 13:37:39,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 249 states. [2018-07-25 13:37:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 13:37:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 13:37:39,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:39,198 INFO L354 BasicCegarLoop]: trace histogram [247, 1, 1, 1] [2018-07-25 13:37:39,198 INFO L415 AbstractCegarLoop]: === Iteration 248 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1702430906, now seen corresponding path program 247 times [2018-07-25 13:37:39,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30628 backedges. 0 proven. 30628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:41,496 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:41,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [249] total 249 [2018-07-25 13:37:41,497 INFO L451 AbstractCegarLoop]: Interpolant automaton has 250 states [2018-07-25 13:37:41,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 250 interpolants. [2018-07-25 13:37:41,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31125, Invalid=31125, Unknown=0, NotChecked=0, Total=62250 [2018-07-25 13:37:41,500 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 250 states. [2018-07-25 13:37:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:42,135 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-07-25 13:37:42,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2018-07-25 13:37:42,135 INFO L78 Accepts]: Start accepts. Automaton has 250 states. Word has length 250 [2018-07-25 13:37:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:42,136 INFO L225 Difference]: With dead ends: 254 [2018-07-25 13:37:42,136 INFO L226 Difference]: Without dead ends: 252 [2018-07-25 13:37:42,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31125, Invalid=31125, Unknown=0, NotChecked=0, Total=62250 [2018-07-25 13:37:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-07-25 13:37:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-07-25 13:37:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-07-25 13:37:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-07-25 13:37:42,140 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 250 [2018-07-25 13:37:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:42,141 INFO L472 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-07-25 13:37:42,141 INFO L473 AbstractCegarLoop]: Interpolant automaton has 250 states. [2018-07-25 13:37:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-07-25 13:37:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-07-25 13:37:42,141 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:42,141 INFO L354 BasicCegarLoop]: trace histogram [248, 1, 1, 1] [2018-07-25 13:37:42,142 INFO L415 AbstractCegarLoop]: === Iteration 249 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1235754400, now seen corresponding path program 248 times [2018-07-25 13:37:42,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-25 13:37:43,297 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:37:43,302 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:37:43,303 INFO L202 PluginConnector]: Adding new model Luxembourg.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:37:43 BoogieIcfgContainer [2018-07-25 13:37:43,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:37:43,306 INFO L168 Benchmark]: Toolchain (without parser) took 262497.61 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -734.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-07-25 13:37:43,308 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:37:43,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.70 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:37:43,309 INFO L168 Benchmark]: Boogie Preprocessor took 20.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:37:43,309 INFO L168 Benchmark]: RCFGBuilder took 198.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:37:43,309 INFO L168 Benchmark]: TraceAbstraction took 262236.59 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -745.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-07-25 13:37:43,311 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.19 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 37.70 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.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 198.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262236.59 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -745.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was analyzing trace of length 252 with TraceHistMax 248, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 138 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 262.1s OverallTime, 249 OverallIterations, 248 TraceHistogramMax, 96.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 746 SDtfs, 2 SDslu, 16207 SDs, 0 SdLazy, 47331 SolverSat, 465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31124 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 30876 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 114.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 248 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 33.9s SatisfiabilityAnalysisTime, 124.7s InterpolantComputationTime, 31372 NumberOfCodeBlocks, 31372 NumberOfCodeBlocksAsserted, 248 NumberOfCheckSat, 31124 ConstructedInterpolants, 0 QuantifiedInterpolants, 15469124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 248 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2542124 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/Luxembourg.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-37-43-321.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-37-43-321.csv Completed graceful shutdown