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/20170304-DifficultPathPrograms/phases1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:28:55,421 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:28:55,423 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:28:55,438 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:28:55,438 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:28:55,440 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:28:55,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:28:55,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:28:55,447 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:28:55,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:28:55,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:28:55,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:28:55,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:28:55,460 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:28:55,461 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:28:55,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:28:55,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:28:55,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:28:55,467 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:28:55,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:28:55,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:28:55,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:28:55,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:28:55,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:28:55,480 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:28:55,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:28:55,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:28:55,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:28:55,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:28:55,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:28:55,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:28:55,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:28:55,488 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:28:55,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:28:55,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:28:55,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:28:55,490 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:28:55,498 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:28:55,498 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:28:55,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:28:55,499 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:28:55,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:28:55,500 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:28:55,500 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:28:55,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:28:55,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:28:55,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:28:55,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:28:55,579 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:28:55,580 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:28:55,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/phases1.i_3.bpl [2018-07-25 13:28:55,581 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/phases1.i_3.bpl' [2018-07-25 13:28:55,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:28:55,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:28:55,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:28:55,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:28:55,632 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:28:55,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:28:55,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:28:55,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:28:55,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:28:55,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:28:55,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:28:55,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:28:55,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:28:55,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/1) ... [2018-07-25 13:28:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:28:55,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:28:55,945 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:28:55,945 INFO L202 PluginConnector]: Adding new model phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:28:55 BoogieIcfgContainer [2018-07-25 13:28:55,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:28:55,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:28:55,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:28:55,950 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:28:55,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:28:55" (1/2) ... [2018-07-25 13:28:55,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2980f643 and model type phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:28:55, skipping insertion in model container [2018-07-25 13:28:55,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:28:55" (2/2) ... [2018-07-25 13:28:55,954 INFO L112 eAbstractionObserver]: Analyzing ICFG phases1.i_3.bpl [2018-07-25 13:28:55,964 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:28:55,970 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:28:56,006 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:28:56,007 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:28:56,007 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:28:56,007 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:28:56,007 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:28:56,007 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:28:56,007 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:28:56,008 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:28:56,008 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:28:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:28:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:28:56,029 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:56,030 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:28:56,031 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 13:28:56,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:56,125 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:28:56,128 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:28:56,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:28:56,133 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:28:56,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:28:56,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:28:56,148 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:28:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:56,180 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 13:28:56,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:28:56,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 13:28:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:56,193 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:28:56,193 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:28:56,196 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:28:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:28:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:28:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:28:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:28:56,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 13:28:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:56,235 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:28:56,235 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:28:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:28:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:28:56,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:56,236 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:28:56,237 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 13:28:56,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:56,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:56,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:28:56,300 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:28:56,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:28:56,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:28:56,301 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 13:28:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:56,322 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:28:56,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:28:56,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:28:56,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:56,324 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:28:56,324 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:28:56,326 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:28:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:28:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:28:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:28:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:28:56,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 13:28:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:56,330 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:28:56,330 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:28:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:28:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:28:56,331 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:56,331 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 13:28:56,332 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 13:28:56,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:56,409 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:28:56,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:56,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:28:56,411 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:28:56,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:28:56,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:28:56,414 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 13:28:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:56,467 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:28:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:28:56,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 13:28:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:56,471 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:28:56,471 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:28:56,472 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:28:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:28:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:28:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:28:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:28:56,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 13:28:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:56,483 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:28:56,483 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:28:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:28:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:28:56,484 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:56,484 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 13:28:56,486 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 13:28:56,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:56,588 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:56,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:28:56,590 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:28:56,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:28:56,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:28:56,591 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 13:28:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:56,647 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:28:56,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:28:56,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 13:28:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:56,648 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:28:56,648 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:28:56,649 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:28:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:28:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:28:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:28:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:28:56,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 13:28:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:56,654 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:28:56,654 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:28:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:28:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:28:56,655 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:56,655 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 13:28:56,656 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:56,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 13:28:56,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:56,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:56,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:28:56,720 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:28:56,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:28:56,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:28:56,727 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 13:28:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:56,790 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:28:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:28:56,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 13:28:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:56,793 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:28:56,794 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:28:56,794 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:28:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:28:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:28:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:28:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:28:56,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 13:28:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:56,807 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:28:56,807 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:28:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:28:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:28:56,810 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:56,810 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 13:28:56,810 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 13:28:56,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:56,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:56,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:28:56,908 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:28:56,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:28:56,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:28:56,909 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 13:28:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:56,978 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:28:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:28:56,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:28:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:56,980 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:28:56,980 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:28:56,982 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:28:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:28:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:28:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:28:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:28:56,990 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 13:28:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:56,992 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:28:56,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:28:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:28:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:28:56,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:56,993 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 13:28:56,993 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 13:28:56,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:57,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:57,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:28:57,068 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:28:57,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:28:57,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:28:57,070 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 13:28:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:57,115 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:28:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:28:57,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:28:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:57,117 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:28:57,117 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:28:57,117 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:28:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:28:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:28:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:28:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:28:57,123 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 13:28:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:57,123 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:28:57,124 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:28:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:28:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:28:57,125 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,125 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 13:28:57,125 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 13:28:57,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:57,173 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:57,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:28:57,173 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:28:57,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:28:57,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:28:57,175 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 13:28:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:57,239 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:28:57,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:28:57,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:28:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:57,244 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:28:57,244 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:28:57,245 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:28:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:28:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:28:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:28:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:28:57,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 13:28:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:57,256 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:28:57,256 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:28:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:28:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:28:57,257 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,259 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 13:28:57,260 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,260 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 13:28:57,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:57,332 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:57,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:28:57,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:28:57,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:28:57,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:28:57,335 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 13:28:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:57,382 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:28:57,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:28:57,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:28:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:57,384 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:28:57,386 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:28:57,386 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:28:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:28:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:28:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:28:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:28:57,393 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 13:28:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:57,393 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:28:57,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:28:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:28:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:28:57,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,394 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 13:28:57,395 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-25 13:28:57,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:57,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:57,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:28:57,452 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:28:57,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:28:57,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:28:57,453 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-25 13:28:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:57,497 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:28:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:28:57,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 13:28:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:57,498 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:28:57,498 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:28:57,499 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:28:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:28:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:28:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:28:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:28:57,507 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 13:28:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:57,508 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:28:57,508 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:28:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:28:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:28:57,510 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,510 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 13:28:57,510 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-25 13:28:57,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:57,586 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:57,586 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:28:57,587 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:28:57,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:28:57,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:28:57,588 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-25 13:28:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:57,642 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:28:57,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:28:57,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-25 13:28:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:57,644 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:28:57,644 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:28:57,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:28:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:28:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:28:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:28:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:28:57,658 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 13:28:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:57,659 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:28:57,659 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:28:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:28:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:28:57,662 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,662 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 13:28:57,663 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-25 13:28:57,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:57,747 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:57,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:28:57,748 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:28:57,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:28:57,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:28:57,749 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-25 13:28:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:57,805 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:28:57,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:28:57,806 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 13:28:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:57,808 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:28:57,809 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:28:57,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:28:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:28:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:28:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:28:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:28:57,818 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 13:28:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:57,819 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:28:57,819 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:28:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:28:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:28:57,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,820 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 13:28:57,821 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-25 13:28:57,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:57,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:57,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:28:57,908 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:28:57,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:28:57,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:28:57,909 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-25 13:28:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:57,971 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:28:57,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:28:57,972 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-25 13:28:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:57,973 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:28:57,973 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:28:57,974 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:28:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:28:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:28:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:28:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:28:57,982 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 13:28:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:57,982 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:28:57,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:28:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:28:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:28:57,985 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,986 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 13:28:57,986 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-25 13:28:57,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:58,079 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:58,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:28:58,080 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:28:58,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:28:58,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:28:58,081 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-25 13:28:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,146 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:28:58,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:28:58,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 13:28:58,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,147 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:28:58,147 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:28:58,148 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:28:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:28:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:28:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:28:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:28:58,154 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 13:28:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,154 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:28:58,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:28:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:28:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:28:58,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,156 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 13:28:58,156 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-25 13:28:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,240 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:28:58,241 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:58,241 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:28:58,242 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:28:58,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:28:58,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:28:58,243 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-25 13:28:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,309 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:28:58,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:28:58,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-25 13:28:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,310 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:28:58,310 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:28:58,311 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:28:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:28:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:28:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:28:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:28:58,316 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 13:28:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,317 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:28:58,317 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:28:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:28:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:28:58,318 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,318 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 13:28:58,318 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-25 13:28:58,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:58,419 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:58,419 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:28:58,419 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:28:58,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:28:58,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:28:58,420 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-25 13:28:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,496 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:28:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:28:58,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 13:28:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,497 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:28:58,497 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:28:58,498 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:28:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:28:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:28:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:28:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:28:58,504 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 13:28:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,504 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:28:58,504 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:28:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:28:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:28:58,505 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,505 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 13:28:58,506 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-25 13:28:58,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:58,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:58,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:28:58,612 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:28:58,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:28:58,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:28:58,613 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-25 13:28:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,697 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:28:58,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:28:58,698 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-25 13:28:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,698 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:28:58,699 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:28:58,699 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:28:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:28:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:28:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:28:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:28:58,705 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 13:28:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,705 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:28:58,705 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:28:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:28:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:28:58,706 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,707 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 13:28:58,707 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-25 13:28:58,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:58,816 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:58,816 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:28:58,817 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:28:58,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:28:58,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:28:58,818 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-25 13:28:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,918 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:28:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:28:58,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 13:28:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,919 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:28:58,919 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:28:58,922 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:28:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:28:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:28:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:28:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:28:58,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 13:28:58,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:58,930 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:28:58,931 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:28:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:28:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:28:58,932 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:58,932 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 13:28:58,932 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-25 13:28:58,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:59,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:59,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:28:59,066 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:28:59,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:28:59,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:28:59,068 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-25 13:28:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,173 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:28:59,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:28:59,174 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-25 13:28:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,175 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:28:59,175 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:28:59,176 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:28:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:28:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:28:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:28:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:28:59,185 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 13:28:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,186 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:28:59,186 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:28:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:28:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:28:59,187 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,187 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 13:28:59,188 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-25 13:28:59,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:59,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:59,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:28:59,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:28:59,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:28:59,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:28:59,329 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-25 13:28:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,446 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:28:59,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:28:59,447 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 13:28:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,449 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:28:59,449 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:28:59,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:28:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:28:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:28:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:28:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:28:59,456 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 13:28:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,456 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:28:59,456 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:28:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:28:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:28:59,457 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,457 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 13:28:59,458 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-25 13:28:59,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:59,600 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:59,600 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:28:59,601 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:28:59,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:28:59,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:28:59,602 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-25 13:28:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:59,736 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:28:59,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:28:59,736 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-25 13:28:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:59,737 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:28:59,737 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:28:59,738 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:28:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:28:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:28:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:28:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:28:59,747 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 13:28:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,747 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:28:59,747 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:28:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:28:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:28:59,748 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,748 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 13:28:59,749 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-25 13:28:59,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:59,966 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:59,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:28:59,967 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:28:59,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:28:59,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:28:59,968 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-25 13:29:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:00,113 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:29:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:29:00,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 13:29:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:00,114 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:29:00,114 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:29:00,115 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:29:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:29:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:29:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:29:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:29:00,125 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 13:29:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:00,126 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:29:00,126 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:29:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:29:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:29:00,127 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:00,127 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 13:29:00,128 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-25 13:29:00,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:00,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:00,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:29:00,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:29:00,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:29:00,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:29:00,295 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-25 13:29:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:00,434 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:29:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:29:00,434 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-25 13:29:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:00,435 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:29:00,435 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:29:00,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:29:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:29:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:29:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:29:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:29:00,450 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 13:29:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:00,450 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:29:00,450 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:29:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:29:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:29:00,453 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:00,454 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 13:29:00,454 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-25 13:29:00,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:00,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:00,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:29:00,613 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:29:00,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:29:00,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:29:00,614 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-25 13:29:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:00,756 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:29:00,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:29:00,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 13:29:00,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:00,757 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:29:00,757 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:29:00,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:29:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:29:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:29:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:29:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:29:00,763 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 13:29:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:00,764 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:29:00,764 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:29:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:29:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:29:00,765 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:00,765 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 13:29:00,765 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-25 13:29:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:00,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:00,944 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:29:00,945 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:29:00,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:29:00,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:29:00,946 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-25 13:29:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,094 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:29:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:29:01,094 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-25 13:29:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,095 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:29:01,095 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:29:01,096 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:29:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:29:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:29:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:29:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:29:01,101 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 13:29:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,102 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:29:01,102 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:29:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:29:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:29:01,102 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,103 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 13:29:01,103 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-25 13:29:01,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:01,278 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:01,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:29:01,278 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:29:01,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:29:01,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:29:01,279 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-25 13:29:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,429 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:29:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:29:01,429 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 13:29:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,430 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:29:01,430 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:29:01,431 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:29:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:29:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:29:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:29:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:29:01,436 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 13:29:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,436 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:29:01,436 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:29:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:29:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:29:01,437 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,437 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 13:29:01,437 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-25 13:29:01,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:01,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:01,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:29:01,630 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:29:01,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:29:01,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:29:01,632 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-25 13:29:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:01,808 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:29:01,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:29:01,808 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-25 13:29:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:01,809 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:29:01,809 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:29:01,811 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:29:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:29:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:29:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:29:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:29:01,818 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 13:29:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:01,818 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:29:01,818 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:29:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:29:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:29:01,819 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:01,819 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 13:29:01,821 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:01,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-25 13:29:01,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:02,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:02,010 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:29:02,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:29:02,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:29:02,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:29:02,011 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-25 13:29:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,195 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:29:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:29:02,195 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 13:29:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,196 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:29:02,196 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:29:02,197 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:29:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:29:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:29:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:29:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:29:02,202 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 13:29:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,203 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:29:02,203 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:29:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:29:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:29:02,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,204 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 13:29:02,204 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,204 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-25 13:29:02,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:02,391 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:02,391 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:29:02,391 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:29:02,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:29:02,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:29:02,392 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-25 13:29:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:02,597 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:29:02,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:29:02,598 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-25 13:29:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:02,598 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:29:02,599 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:29:02,599 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:29:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:29:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:29:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:29:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:29:02,607 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 13:29:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:02,607 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:29:02,607 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:29:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:29:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:29:02,608 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:02,608 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 13:29:02,609 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:02,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-25 13:29:02,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:02,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:02,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:29:02,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:29:02,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:29:02,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:29:02,849 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-25 13:29:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:03,088 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:29:03,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:29:03,088 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 13:29:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:03,089 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:29:03,089 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:29:03,090 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:29:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:29:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:29:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:29:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:29:03,096 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 13:29:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:03,096 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:29:03,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:29:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:29:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:29:03,097 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:03,097 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 13:29:03,097 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:03,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-25 13:29:03,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:03,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:03,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:29:03,295 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:29:03,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:29:03,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:29:03,297 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-25 13:29:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:03,482 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:29:03,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:29:03,483 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-25 13:29:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:03,483 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:29:03,484 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:29:03,484 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:29:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:29:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:29:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:29:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:29:03,489 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 13:29:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:03,489 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:29:03,490 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:29:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:29:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:29:03,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:03,490 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 13:29:03,491 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:03,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-25 13:29:03,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:03,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:03,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:29:03,678 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:29:03,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:29:03,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:29:03,679 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-25 13:29:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:03,875 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:29:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:29:03,875 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 13:29:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:03,876 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:29:03,876 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:29:03,877 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:29:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:29:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:29:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:29:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:29:03,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 13:29:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:03,882 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:29:03,882 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:29:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:29:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:29:03,883 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:03,883 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 13:29:03,883 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:03,884 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-25 13:29:03,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:04,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:04,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:29:04,075 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:29:04,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:29:04,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:29:04,076 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-25 13:29:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:04,273 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:29:04,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:29:04,273 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-25 13:29:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:04,274 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:29:04,274 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:29:04,275 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:29:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:29:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:29:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:29:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:29:04,280 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 13:29:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:04,280 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:29:04,280 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:29:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:29:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:29:04,281 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:04,281 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 13:29:04,281 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:04,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-25 13:29:04,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:04,486 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:04,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:29:04,486 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:29:04,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:29:04,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:29:04,487 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-25 13:29:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:04,700 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:29:04,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:29:04,700 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 13:29:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:04,701 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:29:04,701 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:29:04,702 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:29:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:29:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:29:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:29:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:29:04,708 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 13:29:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:04,708 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:29:04,708 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:29:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:29:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:29:04,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:04,709 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 13:29:04,709 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-25 13:29:04,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:04,964 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:04,964 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:29:04,965 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:29:04,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:29:04,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:29:04,966 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-25 13:29:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:05,193 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:29:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:29:05,193 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-25 13:29:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:05,194 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:29:05,194 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:29:05,195 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:29:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:29:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:29:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:29:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:29:05,203 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 13:29:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:05,203 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:29:05,203 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:29:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:29:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:29:05,204 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:05,204 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 13:29:05,204 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:05,205 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-25 13:29:05,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:05,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:05,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:29:05,433 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:29:05,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:29:05,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:29:05,434 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-25 13:29:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:05,693 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:29:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:29:05,693 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 13:29:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:05,694 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:29:05,694 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:29:05,695 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:29:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:29:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:29:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:29:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:29:05,702 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 13:29:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:05,702 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:29:05,702 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:29:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:29:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:29:05,703 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:05,704 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 13:29:05,704 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:05,704 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-25 13:29:05,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:05,983 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:05,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:29:05,984 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:29:05,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:29:05,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:29:05,986 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-25 13:29:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:06,266 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:29:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:29:06,266 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-25 13:29:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:06,267 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:29:06,267 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:29:06,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:29:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:29:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:29:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:29:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:29:06,273 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 13:29:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:06,274 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:29:06,274 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:29:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:29:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:29:06,275 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:06,275 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 13:29:06,275 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-25 13:29:06,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:06,507 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:06,508 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:29:06,508 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:29:06,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:29:06,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:29:06,509 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-25 13:29:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:06,765 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:29:06,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:29:06,766 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 13:29:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:06,766 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:29:06,766 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:29:06,767 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:29:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:29:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:29:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:29:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:29:06,778 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 13:29:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:06,778 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:29:06,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:29:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:29:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:29:06,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:06,779 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 13:29:06,779 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-25 13:29:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:07,018 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:07,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:29:07,019 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:29:07,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:29:07,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:29:07,020 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-25 13:29:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:07,282 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:29:07,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:29:07,282 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-25 13:29:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:07,283 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:29:07,283 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:29:07,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:29:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:29:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:29:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:29:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:29:07,291 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 13:29:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:07,292 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:29:07,292 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:29:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:29:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:29:07,293 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:07,293 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 13:29:07,293 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-25 13:29:07,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:07,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:07,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:29:07,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:29:07,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:29:07,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:29:07,542 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-25 13:29:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:07,814 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:29:07,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:29:07,814 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 13:29:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:07,815 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:29:07,815 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:29:07,816 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:29:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:29:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:29:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:29:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:29:07,822 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 13:29:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:07,823 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:29:07,823 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:29:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:29:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:29:07,824 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:07,824 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 13:29:07,824 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-25 13:29:07,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:08,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:08,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:29:08,099 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:29:08,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:29:08,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:29:08,101 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-25 13:29:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:08,385 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:29:08,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:29:08,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-25 13:29:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:08,387 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:29:08,387 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:29:08,388 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:29:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:29:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:29:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:29:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:29:08,395 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 13:29:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:08,395 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:29:08,396 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:29:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:29:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:29:08,396 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:08,397 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 13:29:08,397 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:08,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-25 13:29:08,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:08,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:08,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:29:08,684 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:29:08,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:29:08,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:29:08,685 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-25 13:29:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:08,977 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:29:08,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:29:08,977 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 13:29:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:08,978 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:29:08,978 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:29:08,980 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:29:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:29:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:29:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:29:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:29:08,988 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 13:29:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:08,989 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:29:08,989 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:29:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:29:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:29:08,990 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:08,990 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 13:29:08,990 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-25 13:29:08,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:09,316 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:09,317 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:29:09,317 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:29:09,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:29:09,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:29:09,319 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-25 13:29:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:09,672 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:29:09,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:29:09,673 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-25 13:29:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:09,673 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:29:09,674 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:29:09,676 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:29:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:29:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:29:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:29:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:29:09,686 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 13:29:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:09,686 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:29:09,686 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:29:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:29:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:29:09,688 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:09,688 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 13:29:09,688 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:09,688 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-25 13:29:09,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:09,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:09,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:29:09,948 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:29:09,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:29:09,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:29:09,949 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-25 13:29:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:10,240 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:29:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:29:10,241 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 13:29:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:10,241 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:29:10,242 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:29:10,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:29:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:29:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:29:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:29:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:29:10,249 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 13:29:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:10,249 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:29:10,249 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:29:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:29:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:29:10,250 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:10,250 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 13:29:10,250 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-25 13:29:10,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:10,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:10,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:29:10,517 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:29:10,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:29:10,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:29:10,518 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-25 13:29:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:10,824 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:29:10,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:29:10,825 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-25 13:29:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:10,826 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:29:10,826 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:29:10,826 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:29:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:29:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:29:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:29:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:29:10,833 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 13:29:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:10,833 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:29:10,833 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:29:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:29:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:29:10,835 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:10,835 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 13:29:10,835 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-25 13:29:10,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:11,127 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:11,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:29:11,128 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:29:11,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:29:11,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:29:11,129 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-25 13:29:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:11,435 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:29:11,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:29:11,436 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 13:29:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:11,436 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:29:11,437 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:29:11,437 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:29:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:29:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:29:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:29:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:29:11,444 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 13:29:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:11,445 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:29:11,445 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:29:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:29:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:29:11,446 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:11,446 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 13:29:11,446 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:11,446 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-25 13:29:11,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:11,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:11,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:29:11,725 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:29:11,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:29:11,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:29:11,726 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-25 13:29:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:12,040 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:29:12,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:29:12,040 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-25 13:29:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:12,041 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:29:12,041 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:29:12,042 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:29:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:29:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:29:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:29:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:29:12,048 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 13:29:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:12,049 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:29:12,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:29:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:29:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:29:12,050 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:12,050 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 13:29:12,050 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-25 13:29:12,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:12,332 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:12,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:29:12,333 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:29:12,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:29:12,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:29:12,334 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-25 13:29:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:12,681 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:29:12,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:29:12,681 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 13:29:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:12,682 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:29:12,682 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:29:12,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:29:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:29:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:29:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:29:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:29:12,691 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 13:29:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:12,692 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:29:12,692 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:29:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:29:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:29:12,693 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:12,693 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 13:29:12,693 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-25 13:29:12,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:12,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:12,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:29:12,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:29:12,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:29:12,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:29:12,969 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-25 13:29:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:13,298 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:29:13,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:29:13,299 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-25 13:29:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:13,300 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:29:13,300 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:29:13,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:29:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:29:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:29:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:29:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:29:13,309 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 13:29:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:13,309 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:29:13,309 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:29:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:29:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:29:13,310 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:13,310 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 13:29:13,310 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-25 13:29:13,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:13,591 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:13,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:29:13,592 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:29:13,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:29:13,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:29:13,593 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-25 13:29:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:13,917 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:29:13,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:29:13,917 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 13:29:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:13,918 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:29:13,918 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:29:13,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:29:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:29:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:29:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:29:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:29:13,926 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 13:29:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:13,926 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:29:13,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:29:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:29:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:29:13,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:13,928 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 13:29:13,928 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-25 13:29:13,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:14,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:14,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:29:14,220 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:29:14,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:29:14,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:29:14,221 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-25 13:29:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:14,553 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:29:14,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:29:14,553 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-25 13:29:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:14,554 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:29:14,554 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:29:14,555 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:29:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:29:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:29:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:29:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:29:14,566 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 13:29:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:14,567 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:29:14,567 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:29:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:29:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:29:14,568 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:14,568 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 13:29:14,569 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-25 13:29:14,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:14,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:14,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:29:14,844 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:29:14,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:29:14,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:29:14,846 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-25 13:29:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:15,180 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:29:15,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:29:15,180 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 13:29:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:15,181 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:29:15,181 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:29:15,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:29:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:29:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:29:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:29:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:29:15,191 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 13:29:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:15,191 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:29:15,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:29:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:29:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:29:15,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:15,193 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 13:29:15,193 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:15,193 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-25 13:29:15,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:15,552 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:15,552 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:29:15,553 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:29:15,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:29:15,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:29:15,554 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-25 13:29:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:15,935 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:29:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:29:15,935 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-25 13:29:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:15,936 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:29:15,937 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:29:15,937 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:29:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:29:15,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:29:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:29:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:29:15,944 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 13:29:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:15,944 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:29:15,944 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:29:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:29:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:29:15,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:15,946 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 13:29:15,946 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:15,946 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-25 13:29:15,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:16,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:16,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:29:16,236 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:29:16,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:29:16,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:29:16,237 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-25 13:29:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:16,567 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:29:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:29:16,567 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 13:29:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:16,568 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:29:16,568 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:29:16,569 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:29:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:29:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:29:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:29:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:29:16,575 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 13:29:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:16,575 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:29:16,575 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:29:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:29:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:29:16,576 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:16,577 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 13:29:16,577 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-25 13:29:16,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:16,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:16,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:29:16,876 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:29:16,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:29:16,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:29:16,877 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-25 13:29:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,216 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:29:17,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:29:17,217 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-25 13:29:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,218 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:29:17,218 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:29:17,219 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:29:17,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:29:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:29:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:29:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:29:17,225 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 13:29:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,226 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:29:17,226 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:29:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:29:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:29:17,227 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,227 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 13:29:17,228 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-25 13:29:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:17,532 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:17,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:29:17,532 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:29:17,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:29:17,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:29:17,534 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-25 13:29:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,899 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:29:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:29:17,900 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 13:29:17,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,901 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:29:17,901 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:29:17,902 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:29:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:29:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:29:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:29:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:29:17,909 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 13:29:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,909 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:29:17,909 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:29:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:29:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:29:17,910 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,910 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 13:29:17,911 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-25 13:29:17,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:18,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:18,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:29:18,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:29:18,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:29:18,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:29:18,236 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-25 13:29:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:18,623 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:29:18,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:29:18,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-25 13:29:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:18,625 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:29:18,625 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:29:18,626 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:29:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:29:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:29:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:29:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:29:18,633 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 13:29:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:18,633 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:29:18,633 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:29:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:29:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:29:18,634 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:18,634 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 13:29:18,635 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-25 13:29:18,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:18,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:18,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:29:18,958 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:29:18,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:29:18,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:29:18,959 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-25 13:29:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:19,297 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:29:19,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:29:19,297 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 13:29:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:19,298 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:29:19,298 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:29:19,299 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:29:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:29:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:29:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:29:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:29:19,305 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 13:29:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:19,306 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:29:19,306 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:29:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:29:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:29:19,307 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:19,307 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 13:29:19,307 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:19,307 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-25 13:29:19,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:19,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:19,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:29:19,637 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:29:19,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:29:19,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:29:19,638 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-25 13:29:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:20,014 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:29:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:29:20,015 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-25 13:29:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:20,016 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:29:20,016 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:29:20,016 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:29:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:29:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:29:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:29:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:29:20,023 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 13:29:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:20,024 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:29:20,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:29:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:29:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:29:20,024 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:20,025 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 13:29:20,025 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-25 13:29:20,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:20,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:20,372 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:29:20,372 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:29:20,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:29:20,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:29:20,373 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-25 13:29:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:20,772 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:29:20,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:29:20,773 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 13:29:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:20,774 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:29:20,774 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:29:20,775 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:29:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:29:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:29:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:29:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:29:20,782 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 13:29:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:20,782 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:29:20,782 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:29:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:29:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:29:20,783 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:20,783 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 13:29:20,784 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-25 13:29:20,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:21,196 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:21,196 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:29:21,197 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:29:21,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:29:21,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:29:21,198 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-25 13:29:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:21,589 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:29:21,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:29:21,589 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-25 13:29:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:21,591 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:29:21,591 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:29:21,592 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:29:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:29:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:29:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:29:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:29:21,603 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 13:29:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:21,603 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:29:21,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:29:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:29:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:29:21,604 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:21,604 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 13:29:21,605 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-25 13:29:21,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:21,973 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:21,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:29:21,973 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:29:21,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:29:21,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:29:21,975 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-25 13:29:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:22,261 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:29:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:29:22,262 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 13:29:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:22,263 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:29:22,263 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:29:22,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:29:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:29:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:29:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:29:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:29:22,271 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 13:29:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:22,271 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:29:22,271 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:29:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:29:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:29:22,272 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:22,272 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 13:29:22,273 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-25 13:29:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:22,641 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:22,641 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:29:22,641 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:29:22,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:29:22,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:29:22,643 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-25 13:29:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:23,004 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:29:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:29:23,005 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-25 13:29:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:23,006 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:29:23,006 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:29:23,007 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:29:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:29:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:29:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:29:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:29:23,016 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 13:29:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:23,016 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:29:23,017 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:29:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:29:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:29:23,017 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:23,018 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 13:29:23,023 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:23,024 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-25 13:29:23,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:23,367 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:23,367 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:29:23,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:29:23,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:29:23,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:29:23,368 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-25 13:29:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:23,745 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:29:23,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:29:23,745 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 13:29:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:23,747 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:29:23,747 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:29:23,750 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:29:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:29:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:29:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:29:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:29:23,759 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 13:29:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:23,760 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:29:23,760 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:29:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:29:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:29:23,761 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:23,761 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 13:29:23,762 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-25 13:29:23,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:24,150 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:24,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:29:24,151 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:29:24,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:29:24,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:29:24,152 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-25 13:29:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:24,485 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:29:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:29:24,485 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-25 13:29:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:24,486 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:29:24,486 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:29:24,487 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:29:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:29:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:29:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:29:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:29:24,494 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 13:29:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:24,495 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:29:24,495 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:29:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:29:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:29:24,495 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:24,496 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 13:29:24,496 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-25 13:29:24,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:24,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:24,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:29:24,825 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:29:24,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:29:24,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:29:24,826 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-25 13:29:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:25,142 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:29:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:29:25,142 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 13:29:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:25,143 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:29:25,143 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:29:25,143 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:29:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:29:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:29:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:29:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:29:25,149 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 13:29:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:25,149 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:29:25,149 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:29:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:29:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:29:25,150 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:25,150 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 13:29:25,150 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-25 13:29:25,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:25,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:25,560 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:29:25,560 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:29:25,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:29:25,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:29:25,561 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-25 13:29:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:26,053 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:29:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:29:26,053 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-25 13:29:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:26,054 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:29:26,054 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:29:26,055 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:29:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:29:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:29:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:29:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:29:26,063 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 13:29:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:26,064 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:29:26,064 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:29:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:29:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:29:26,065 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:26,065 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 13:29:26,065 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-25 13:29:26,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:26,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:26,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:29:26,505 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:29:26,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:29:26,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:29:26,505 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-25 13:29:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:26,840 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:29:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:29:26,840 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 13:29:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:26,841 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:29:26,841 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:29:26,842 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:29:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:29:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:29:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:29:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:29:26,849 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 13:29:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:26,850 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:29:26,850 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:29:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:29:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:29:26,850 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:26,850 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 13:29:26,851 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-25 13:29:26,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:27,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:27,355 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:29:27,355 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:29:27,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:29:27,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:29:27,355 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-25 13:29:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:27,663 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:29:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:29:27,663 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-25 13:29:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:27,664 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:29:27,664 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:29:27,665 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:29:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:29:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:29:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:29:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:29:27,672 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 13:29:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:27,672 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:29:27,672 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:29:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:29:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:29:27,673 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:27,673 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 13:29:27,674 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-25 13:29:27,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:28,056 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:28,056 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:29:28,056 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:29:28,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:29:28,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:29:28,057 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-25 13:29:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:28,416 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:29:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:29:28,416 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 13:29:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:28,418 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:29:28,418 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:29:28,419 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:29:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:29:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:29:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:29:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:29:28,428 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 13:29:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:28,428 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:29:28,428 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:29:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:29:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:29:28,429 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:28,429 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 13:29:28,429 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-25 13:29:28,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:28,907 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:28,907 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:29:28,907 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:29:28,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:29:28,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:29:28,908 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-25 13:29:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:29,453 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:29:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:29:29,453 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-25 13:29:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:29,454 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:29:29,454 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:29:29,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:29:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:29:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:29:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:29:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:29:29,462 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 13:29:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:29,462 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:29:29,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:29:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:29:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:29:29,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:29,463 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 13:29:29,464 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-25 13:29:29,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:29,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:29,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:29:29,849 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:29:29,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:29:29,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:29:29,849 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-25 13:29:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:30,229 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:29:30,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:29:30,229 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 13:29:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:30,230 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:29:30,230 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:29:30,230 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:29:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:29:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:29:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:29:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:29:30,238 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 13:29:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:30,238 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:29:30,238 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:29:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:29:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:29:30,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:30,239 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 13:29:30,240 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-25 13:29:30,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:30,580 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:30,580 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:29:30,580 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:29:30,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:29:30,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:29:30,581 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-25 13:29:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:30,959 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:29:30,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:29:30,959 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-25 13:29:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:30,960 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:29:30,960 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:29:30,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:29:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:29:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:29:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:29:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:29:30,969 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 13:29:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:30,970 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:29:30,970 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:29:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:29:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:29:30,971 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:30,971 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 13:29:30,971 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-25 13:29:30,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:31,342 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:31,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:29:31,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:29:31,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:29:31,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:29:31,343 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-25 13:29:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:31,734 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:29:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:29:31,735 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 13:29:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:31,736 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:29:31,736 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:29:31,737 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:29:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:29:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:29:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:29:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:29:31,745 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 13:29:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:31,745 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:29:31,745 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:29:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:29:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:29:31,746 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:31,746 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 13:29:31,746 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-25 13:29:31,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:32,150 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:32,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:29:32,150 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:29:32,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:29:32,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:29:32,151 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-25 13:29:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:32,562 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:29:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:29:32,562 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-25 13:29:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:32,564 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:29:32,564 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:29:32,565 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:29:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:29:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:29:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:29:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:29:32,574 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 13:29:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:32,574 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:29:32,574 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:29:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:29:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:29:32,575 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:32,575 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 13:29:32,576 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-25 13:29:32,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:32,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:32,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:29:32,999 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:29:32,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:29:32,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:29:32,999 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-25 13:29:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:33,369 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:29:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:29:33,370 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 13:29:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:33,371 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:29:33,371 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:29:33,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:29:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:29:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:29:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:29:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:29:33,382 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 13:29:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:33,382 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:29:33,382 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:29:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:29:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:29:33,383 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:33,383 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 13:29:33,383 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-25 13:29:33,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:33,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:33,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:29:33,757 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:29:33,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:29:33,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:29:33,758 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-25 13:29:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:34,140 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:29:34,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:29:34,140 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-25 13:29:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:34,142 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:29:34,142 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:29:34,142 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:29:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:29:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:29:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:29:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:29:34,151 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 13:29:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:34,151 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:29:34,151 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:29:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:29:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:29:34,152 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:34,152 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 13:29:34,152 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-25 13:29:34,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:34,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:34,506 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:29:34,507 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:29:34,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:29:34,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:29:34,507 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-25 13:29:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:34,928 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:29:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:29:34,928 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 13:29:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:34,929 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:29:34,929 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:29:34,930 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:29:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:29:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:29:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:29:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:29:34,938 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 13:29:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:34,939 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:29:34,939 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:29:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:29:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:29:34,940 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:34,940 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 13:29:34,940 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-07-25 13:29:34,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:35,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:35,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:29:35,354 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:29:35,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:29:35,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:29:35,355 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-25 13:29:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:35,785 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:29:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:29:35,786 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-25 13:29:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:35,787 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:29:35,787 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:29:35,787 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:29:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:29:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:29:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:29:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:29:35,795 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 13:29:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:35,796 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:29:35,796 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:29:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:29:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:29:35,797 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:35,797 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 13:29:35,797 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-07-25 13:29:35,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:36,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:36,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:29:36,189 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:29:36,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:29:36,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:29:36,190 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-25 13:29:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:36,681 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:29:36,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:29:36,681 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 13:29:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:36,683 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:29:36,683 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:29:36,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:29:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:29:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:29:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:29:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:29:36,692 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 13:29:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:36,693 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:29:36,693 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:29:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:29:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:29:36,694 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:36,694 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 13:29:36,694 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-07-25 13:29:36,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:37,126 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:29:37,126 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:29:37,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:29:37,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:29:37,127 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-25 13:29:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:37,572 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:29:37,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:29:37,572 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-25 13:29:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:37,573 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:29:37,573 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:29:37,574 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:29:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:29:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:29:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:29:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:29:37,582 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 13:29:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:37,582 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:29:37,582 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:29:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:29:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:29:37,583 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:37,583 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 13:29:37,584 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-07-25 13:29:37,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:38,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:38,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:29:38,102 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:29:38,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:29:38,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:29:38,103 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-25 13:29:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:38,549 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:29:38,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:29:38,550 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 13:29:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:38,550 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:29:38,550 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:29:38,551 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:29:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:29:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:29:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:29:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:29:38,556 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 13:29:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:38,557 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:29:38,557 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:29:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:29:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:29:38,558 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:38,558 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 13:29:38,558 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:38,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-07-25 13:29:38,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:38,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:38,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:29:38,948 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:29:38,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:29:38,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:29:38,949 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-25 13:29:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,427 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:29:39,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:29:39,427 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-25 13:29:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,429 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:29:39,429 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:29:39,429 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:29:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:29:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:29:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:29:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:29:39,438 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 13:29:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,439 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:29:39,439 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:29:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:29:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:29:39,440 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,440 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 13:29:39,440 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-07-25 13:29:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:39,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:29:39,883 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:29:39,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:29:39,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:29:39,884 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-25 13:29:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:40,388 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:29:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:29:40,389 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 13:29:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:40,390 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:29:40,390 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:29:40,390 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:29:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:29:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:29:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:29:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:29:40,399 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 13:29:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:40,400 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:29:40,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:29:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:29:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:29:40,401 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:40,401 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 13:29:40,401 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-07-25 13:29:40,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:40,893 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:29:40,893 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:40,893 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:29:40,894 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:29:40,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:29:40,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:29:40,894 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-25 13:29:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:41,410 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:29:41,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:29:41,410 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-25 13:29:41,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:41,411 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:29:41,411 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:29:41,412 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:29:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:29:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:29:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:29:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:29:41,420 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 13:29:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:41,421 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:29:41,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:29:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:29:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:29:41,422 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:41,422 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 13:29:41,422 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-07-25 13:29:41,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:41,886 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:41,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:29:41,886 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:29:41,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:29:41,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:29:41,887 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-25 13:29:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:42,397 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:29:42,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:29:42,397 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 13:29:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:42,399 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:29:42,399 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:29:42,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:29:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:29:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:29:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:29:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:29:42,409 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 13:29:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:42,409 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:29:42,409 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:29:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:29:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:29:42,410 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:42,411 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 13:29:42,411 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-07-25 13:29:42,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:43,091 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:43,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:29:43,092 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:29:43,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:29:43,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:29:43,093 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-25 13:29:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:43,621 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:29:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:29:43,621 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-25 13:29:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:43,622 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:29:43,622 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:29:43,623 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:29:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:29:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:29:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:29:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:29:43,629 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 13:29:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:43,630 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:29:43,630 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:29:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:29:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:29:43,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:43,631 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 13:29:43,631 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-07-25 13:29:43,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:44,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:44,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:29:44,229 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:29:44,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:29:44,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:29:44,230 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-25 13:29:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:44,765 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:29:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:29:44,765 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 13:29:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:44,766 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:29:44,766 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:29:44,767 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:29:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:29:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:29:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:29:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:29:44,774 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 13:29:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:44,774 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:29:44,774 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:29:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:29:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:29:44,775 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:44,775 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 13:29:44,775 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:44,775 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-07-25 13:29:44,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:45,215 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:45,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:29:45,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:29:45,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:29:45,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:29:45,216 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-25 13:29:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:45,762 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:29:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:29:45,762 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-25 13:29:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:45,763 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:29:45,763 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:29:45,763 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:29:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:29:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:29:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:29:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:29:45,772 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 13:29:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:45,772 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:29:45,772 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:29:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:29:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:29:45,773 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:45,774 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 13:29:45,774 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:45,774 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-07-25 13:29:45,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:46,359 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:46,359 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:29:46,359 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:29:46,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:29:46,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:29:46,360 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-25 13:29:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:46,952 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:29:46,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:29:46,952 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 13:29:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:46,953 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:29:46,953 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:29:46,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:29:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:29:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:29:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:29:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:29:46,961 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 13:29:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:46,961 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:29:46,961 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:29:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:29:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:29:46,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:46,963 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 13:29:46,963 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-07-25 13:29:46,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:47,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:47,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:29:47,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:29:47,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:29:47,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:29:47,721 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-25 13:29:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:48,263 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:29:48,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:29:48,263 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-25 13:29:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:48,264 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:29:48,264 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:29:48,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:29:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:29:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:29:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:29:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:29:48,273 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 13:29:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:48,273 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:29:48,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:29:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:29:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:29:48,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:48,274 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 13:29:48,274 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:48,275 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-07-25 13:29:48,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:48,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:48,750 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:29:48,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:29:48,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:29:48,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:29:48,751 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-25 13:29:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:49,318 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:29:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:29:49,318 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-25 13:29:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:49,319 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:29:49,319 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:29:49,320 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:29:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:29:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:29:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:29:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:29:49,326 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-25 13:29:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:49,326 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:29:49,326 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:29:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:29:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:29:49,327 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:49,327 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-25 13:29:49,327 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:49,327 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-07-25 13:29:49,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:49,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:49,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:29:49,958 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:29:49,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:29:49,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:29:49,958 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-25 13:29:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:50,550 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 13:29:50,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:29:50,550 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-25 13:29:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:50,551 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:29:50,551 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:29:50,552 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:29:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:29:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:29:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:29:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:29:50,557 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-25 13:29:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:50,558 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:29:50,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:29:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:29:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:29:50,559 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:50,559 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-25 13:29:50,559 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:50,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-07-25 13:29:50,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:51,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:51,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:29:51,168 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:29:51,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:29:51,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:29:51,169 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-25 13:29:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:51,764 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:29:51,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:29:51,764 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-25 13:29:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:51,765 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:29:51,765 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:29:51,766 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:29:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:29:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:29:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:29:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 13:29:51,774 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-25 13:29:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:51,774 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 13:29:51,775 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:29:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 13:29:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:29:51,776 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:51,776 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-25 13:29:51,776 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:51,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1393385107, now seen corresponding path program 94 times [2018-07-25 13:29:51,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:52,330 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:52,330 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:29:52,331 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:29:52,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:29:52,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:29:52,332 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-25 13:29:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:52,948 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 13:29:52,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:29:52,949 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-25 13:29:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:52,950 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:29:52,950 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:29:52,951 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:29:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:29:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:29:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:29:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 13:29:52,959 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-25 13:29:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:52,959 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 13:29:52,959 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:29:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 13:29:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:29:52,960 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:52,961 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-25 13:29:52,961 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash -986656435, now seen corresponding path program 95 times [2018-07-25 13:29:52,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:53,509 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:53,509 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:29:53,510 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:29:53,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:29:53,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:29:53,511 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-25 13:29:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:54,144 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 13:29:54,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:29:54,144 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-25 13:29:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:54,145 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:29:54,145 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:29:54,145 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:29:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:29:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:29:54,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:29:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 13:29:54,154 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-25 13:29:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:54,154 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 13:29:54,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:29:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 13:29:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:29:54,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:54,156 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-25 13:29:54,156 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1010990471, now seen corresponding path program 96 times [2018-07-25 13:29:54,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:54,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:54,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:29:54,705 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:29:54,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:29:54,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:29:54,706 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-25 13:29:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:55,344 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 13:29:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:29:55,344 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-25 13:29:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:55,345 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:29:55,345 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:29:55,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:29:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:29:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:29:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:29:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 13:29:55,354 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-25 13:29:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:55,354 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 13:29:55,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:29:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 13:29:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:29:55,356 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:55,356 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-25 13:29:55,356 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash 899285825, now seen corresponding path program 97 times [2018-07-25 13:29:55,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:55,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:55,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:29:55,947 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:29:55,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:29:55,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:29:55,948 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-25 13:29:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:56,600 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 13:29:56,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:29:56,600 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-25 13:29:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:56,601 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:29:56,601 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:29:56,602 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:29:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:29:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:29:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:29:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:29:56,607 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-25 13:29:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:56,608 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:29:56,608 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:29:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:29:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:29:56,608 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:56,608 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-25 13:29:56,609 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash 925303419, now seen corresponding path program 98 times [2018-07-25 13:29:56,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:57,242 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:57,242 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:29:57,242 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:29:57,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:29:57,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:29:57,243 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-25 13:29:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:57,876 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:29:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:29:57,877 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-25 13:29:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:57,877 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:29:57,878 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:29:57,878 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:29:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:29:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:29:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:29:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 13:29:57,887 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-25 13:29:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:57,887 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 13:29:57,887 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:29:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 13:29:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:29:57,888 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:57,888 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-25 13:29:57,889 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash 158407477, now seen corresponding path program 99 times [2018-07-25 13:29:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:58,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:58,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:29:58,443 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:29:58,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:29:58,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:29:58,443 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-25 13:29:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:59,103 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 13:29:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:29:59,103 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-25 13:29:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:59,104 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:29:59,104 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:29:59,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:29:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:29:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:29:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:29:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 13:29:59,112 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-25 13:29:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:59,112 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 13:29:59,112 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:29:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 13:29:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:29:59,113 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:59,113 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-25 13:29:59,113 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1905782127, now seen corresponding path program 100 times [2018-07-25 13:29:59,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:59,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:59,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:29:59,677 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:29:59,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:29:59,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:29:59,677 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-25 13:30:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:00,368 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 13:30:00,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:30:00,368 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-25 13:30:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:00,369 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:30:00,369 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:30:00,370 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:30:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:30:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:30:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:30:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 13:30:00,379 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-25 13:30:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:00,379 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 13:30:00,379 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:30:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 13:30:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:30:00,380 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:00,381 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-25 13:30:00,381 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1800608041, now seen corresponding path program 101 times [2018-07-25 13:30:00,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:00,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:00,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:30:00,981 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:30:00,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:30:00,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:30:00,982 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-07-25 13:30:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:01,665 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 13:30:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:30:01,665 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-25 13:30:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:01,666 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:30:01,666 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:30:01,667 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:30:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:30:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:30:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:30:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 13:30:01,673 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-25 13:30:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:01,673 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 13:30:01,673 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:30:01,673 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 13:30:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:30:01,674 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:01,674 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-25 13:30:01,674 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:01,674 INFO L82 PathProgramCache]: Analyzing trace with hash -487440797, now seen corresponding path program 102 times [2018-07-25 13:30:01,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:02,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:02,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:30:02,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:30:02,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:30:02,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:30:02,249 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-07-25 13:30:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:02,940 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 13:30:02,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:30:02,940 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-25 13:30:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:02,941 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:30:02,941 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:30:02,942 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:30:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:30:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:30:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:30:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 13:30:02,951 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-25 13:30:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:02,951 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 13:30:02,951 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:30:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 13:30:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:30:02,952 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,952 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-25 13:30:02,953 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash -279118563, now seen corresponding path program 103 times [2018-07-25 13:30:02,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:03,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:03,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:30:03,554 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:30:03,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:30:03,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:30:03,555 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-07-25 13:30:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:04,330 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 13:30:04,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:30:04,330 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-25 13:30:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:04,330 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:30:04,331 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:30:04,331 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:30:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:30:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:30:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:30:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 13:30:04,339 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-25 13:30:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:04,340 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 13:30:04,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:30:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 13:30:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:30:04,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:04,341 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-25 13:30:04,341 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1944914601, now seen corresponding path program 104 times [2018-07-25 13:30:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:04,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:04,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:30:04,958 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:30:04,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:30:04,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:30:04,959 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-07-25 13:30:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:05,684 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 13:30:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:30:05,684 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-25 13:30:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:05,685 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:30:05,685 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:30:05,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:30:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:30:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:30:05,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:30:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 13:30:05,694 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-25 13:30:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:05,694 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 13:30:05,694 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:30:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 13:30:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:30:05,695 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:05,695 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-25 13:30:05,695 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:05,696 INFO L82 PathProgramCache]: Analyzing trace with hash -752105711, now seen corresponding path program 105 times [2018-07-25 13:30:05,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:06,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:06,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:30:06,305 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:30:06,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:30:06,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:30:06,305 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-07-25 13:30:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:07,027 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 13:30:07,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:30:07,027 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-25 13:30:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:07,027 INFO L225 Difference]: With dead ends: 219 [2018-07-25 13:30:07,027 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:30:07,028 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:30:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:30:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 13:30:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 13:30:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 13:30:07,034 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-25 13:30:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:07,034 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 13:30:07,034 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:30:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 13:30:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 13:30:07,035 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:07,035 INFO L354 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-25 13:30:07,035 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1219030453, now seen corresponding path program 106 times [2018-07-25 13:30:07,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:07,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:07,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:30:07,681 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:30:07,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:30:07,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:30:07,682 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-07-25 13:30:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:08,431 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 13:30:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:30:08,431 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-25 13:30:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:08,432 INFO L225 Difference]: With dead ends: 221 [2018-07-25 13:30:08,432 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:30:08,433 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:30:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:30:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 13:30:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 13:30:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 13:30:08,438 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-25 13:30:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:08,438 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 13:30:08,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:30:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 13:30:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 13:30:08,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:08,439 INFO L354 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-25 13:30:08,439 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1037858565, now seen corresponding path program 107 times [2018-07-25 13:30:08,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:09,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:09,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:30:09,060 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:30:09,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:30:09,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:30:09,061 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-07-25 13:30:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:09,816 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 13:30:09,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:30:09,816 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-25 13:30:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:09,816 INFO L225 Difference]: With dead ends: 223 [2018-07-25 13:30:09,817 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:30:09,817 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:30:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:30:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 13:30:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:30:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 13:30:09,824 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-25 13:30:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:09,825 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 13:30:09,825 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:30:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 13:30:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:30:09,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:09,826 INFO L354 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-25 13:30:09,826 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 949720383, now seen corresponding path program 108 times [2018-07-25 13:30:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:10,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:10,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:30:10,477 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:30:10,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:30:10,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:30:10,479 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-07-25 13:30:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:11,330 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 13:30:11,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:30:11,330 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-25 13:30:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:11,331 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:30:11,331 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:30:11,332 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:30:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:30:11,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 13:30:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 13:30:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 13:30:11,340 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-25 13:30:11,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:11,340 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 13:30:11,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:30:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 13:30:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 13:30:11,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:11,341 INFO L354 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-25 13:30:11,342 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:11,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2146693895, now seen corresponding path program 109 times [2018-07-25 13:30:11,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:12,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:12,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:30:12,023 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:30:12,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:30:12,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:30:12,024 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-07-25 13:30:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:12,812 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 13:30:12,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:30:12,812 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-25 13:30:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:12,812 INFO L225 Difference]: With dead ends: 227 [2018-07-25 13:30:12,812 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:30:12,813 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:30:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:30:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 13:30:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:30:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 13:30:12,822 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-25 13:30:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:12,822 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 13:30:12,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:30:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 13:30:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 13:30:12,823 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:12,823 INFO L354 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-25 13:30:12,824 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1388478925, now seen corresponding path program 110 times [2018-07-25 13:30:12,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:13,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:13,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:30:13,809 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:30:13,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:30:13,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:30:13,810 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-07-25 13:30:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:14,622 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 13:30:14,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:30:14,623 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-25 13:30:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:14,623 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:30:14,623 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:30:14,624 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:30:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:30:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 13:30:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:30:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 13:30:14,629 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-25 13:30:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:14,629 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 13:30:14,629 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:30:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 13:30:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 13:30:14,630 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:14,630 INFO L354 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-25 13:30:14,630 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1406634221, now seen corresponding path program 111 times [2018-07-25 13:30:14,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:15,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:15,314 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:30:15,314 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:30:15,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:30:15,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:30:15,315 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-07-25 13:30:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:16,138 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 13:30:16,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:30:16,138 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-25 13:30:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:16,139 INFO L225 Difference]: With dead ends: 231 [2018-07-25 13:30:16,139 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:30:16,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:30:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:30:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 13:30:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 13:30:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 13:30:16,146 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-25 13:30:16,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:16,146 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 13:30:16,146 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:30:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 13:30:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 13:30:16,146 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:16,147 INFO L354 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-25 13:30:16,147 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1139159769, now seen corresponding path program 112 times [2018-07-25 13:30:16,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:16,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:16,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:30:16,831 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:30:16,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:30:16,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:30:16,831 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-07-25 13:30:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:17,659 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 13:30:17,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:30:17,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-25 13:30:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:17,660 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:30:17,660 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:30:17,660 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:30:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:30:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 13:30:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:30:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 13:30:17,669 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-25 13:30:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:17,670 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 13:30:17,670 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:30:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 13:30:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:30:17,671 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:17,671 INFO L354 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-25 13:30:17,671 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash 484174561, now seen corresponding path program 113 times [2018-07-25 13:30:17,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:18,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:18,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:30:18,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:30:18,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:30:18,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:30:18,462 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-07-25 13:30:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:19,283 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 13:30:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:30:19,284 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-25 13:30:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:19,284 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:30:19,284 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:30:19,285 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:30:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:30:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 13:30:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:30:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 13:30:19,294 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-25 13:30:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:19,294 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 13:30:19,294 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:30:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 13:30:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 13:30:19,295 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:19,295 INFO L354 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-25 13:30:19,296 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1435337243, now seen corresponding path program 114 times [2018-07-25 13:30:19,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:20,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:20,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:30:20,024 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:30:20,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:30:20,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:30:20,025 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-07-25 13:30:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:20,875 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 13:30:20,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:30:20,875 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-25 13:30:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:20,876 INFO L225 Difference]: With dead ends: 237 [2018-07-25 13:30:20,876 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 13:30:20,876 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:30:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 13:30:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 13:30:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:30:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 13:30:20,882 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-25 13:30:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:20,882 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 13:30:20,882 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:30:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 13:30:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 13:30:20,883 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:20,883 INFO L354 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-25 13:30:20,883 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:20,883 INFO L82 PathProgramCache]: Analyzing trace with hash 674640597, now seen corresponding path program 115 times [2018-07-25 13:30:20,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:21,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:21,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:30:21,625 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:30:21,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:30:21,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:30:21,626 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-07-25 13:30:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:22,569 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 13:30:22,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:30:22,569 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-25 13:30:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:22,570 INFO L225 Difference]: With dead ends: 239 [2018-07-25 13:30:22,570 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 13:30:22,571 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:30:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 13:30:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 13:30:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 13:30:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 13:30:22,577 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-25 13:30:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:22,577 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 13:30:22,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:30:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 13:30:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 13:30:22,578 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:22,578 INFO L354 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-25 13:30:22,578 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash -210395889, now seen corresponding path program 116 times [2018-07-25 13:30:22,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:23,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:23,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:30:23,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:30:23,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:30:23,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:30:23,371 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-07-25 13:30:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:24,254 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 13:30:24,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:30:24,254 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-25 13:30:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:24,255 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:30:24,255 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:30:24,255 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:30:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:30:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 13:30:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 13:30:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 13:30:24,261 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-25 13:30:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:24,261 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 13:30:24,261 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:30:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 13:30:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 13:30:24,262 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:24,262 INFO L354 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-25 13:30:24,262 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash -326934327, now seen corresponding path program 117 times [2018-07-25 13:30:24,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:25,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:25,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:30:25,015 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:30:25,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:30:25,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:30:25,016 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-07-25 13:30:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:26,006 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 13:30:26,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:30:26,006 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-25 13:30:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:26,007 INFO L225 Difference]: With dead ends: 243 [2018-07-25 13:30:26,007 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 13:30:26,007 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:30:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 13:30:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 13:30:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:30:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 13:30:26,016 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-25 13:30:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:26,016 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 13:30:26,016 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:30:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 13:30:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:30:26,018 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:26,018 INFO L354 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-25 13:30:26,018 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash -651223549, now seen corresponding path program 118 times [2018-07-25 13:30:26,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:26,919 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:26,919 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:30:26,920 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:30:26,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:30:26,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:30:26,920 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-07-25 13:30:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:27,851 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 13:30:27,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:30:27,851 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-07-25 13:30:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:27,852 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:30:27,852 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 13:30:27,853 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:30:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 13:30:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 13:30:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 13:30:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 13:30:27,859 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-25 13:30:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:27,859 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 13:30:27,859 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:30:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 13:30:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 13:30:27,860 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:27,860 INFO L354 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-25 13:30:27,860 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1239446717, now seen corresponding path program 119 times [2018-07-25 13:30:27,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:28,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:28,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:30:28,667 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:30:28,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:30:28,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:30:28,668 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-07-25 13:30:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:29,641 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 13:30:29,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:30:29,642 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-25 13:30:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:29,642 INFO L225 Difference]: With dead ends: 247 [2018-07-25 13:30:29,642 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 13:30:29,643 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:30:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 13:30:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 13:30:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:30:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 13:30:29,648 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-25 13:30:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:29,648 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 13:30:29,648 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:30:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 13:30:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 13:30:29,649 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:29,649 INFO L354 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-25 13:30:29,649 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1402406135, now seen corresponding path program 120 times [2018-07-25 13:30:29,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:30,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:30,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:30:30,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:30:30,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:30:30,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:30:30,441 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-07-25 13:30:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:31,412 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 13:30:31,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:30:31,413 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-07-25 13:30:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:31,414 INFO L225 Difference]: With dead ends: 249 [2018-07-25 13:30:31,414 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 13:30:31,415 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:30:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 13:30:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 13:30:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 13:30:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 13:30:31,424 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-25 13:30:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:31,424 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 13:30:31,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:30:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 13:30:31,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 13:30:31,425 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:31,425 INFO L354 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-25 13:30:31,425 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash -907383119, now seen corresponding path program 121 times [2018-07-25 13:30:31,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:32,248 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:32,248 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:30:32,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:30:32,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:30:32,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:30:32,249 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-07-25 13:30:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:33,257 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-25 13:30:33,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:30:33,258 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-25 13:30:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:33,258 INFO L225 Difference]: With dead ends: 251 [2018-07-25 13:30:33,258 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:30:33,259 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:30:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:30:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 13:30:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 13:30:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-25 13:30:33,268 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-25 13:30:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:33,268 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-25 13:30:33,268 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:30:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-25 13:30:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 13:30:33,270 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:33,270 INFO L354 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-25 13:30:33,270 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash -116764181, now seen corresponding path program 122 times [2018-07-25 13:30:33,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:34,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:34,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:30:34,159 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:30:34,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:30:34,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:30:34,160 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-07-25 13:30:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:35,142 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-25 13:30:35,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:30:35,143 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-07-25 13:30:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:35,143 INFO L225 Difference]: With dead ends: 253 [2018-07-25 13:30:35,143 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 13:30:35,144 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:30:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 13:30:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 13:30:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:30:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 13:30:35,150 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-25 13:30:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:35,150 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 13:30:35,150 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:30:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 13:30:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 13:30:35,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:35,151 INFO L354 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-25 13:30:35,151 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:35,152 INFO L82 PathProgramCache]: Analyzing trace with hash -541176155, now seen corresponding path program 123 times [2018-07-25 13:30:35,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:35,988 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:35,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:30:35,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:30:35,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:30:35,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:30:35,990 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-07-25 13:30:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:37,022 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-25 13:30:37,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:30:37,023 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-25 13:30:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:37,023 INFO L225 Difference]: With dead ends: 255 [2018-07-25 13:30:37,023 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 13:30:37,024 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:30:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 13:30:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 13:30:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 13:30:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-25 13:30:37,029 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-25 13:30:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:37,030 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-25 13:30:37,030 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:30:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-25 13:30:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 13:30:37,031 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:37,031 INFO L354 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-25 13:30:37,031 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:37,031 INFO L82 PathProgramCache]: Analyzing trace with hash -379190049, now seen corresponding path program 124 times [2018-07-25 13:30:37,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:37,866 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:37,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:30:37,866 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:30:37,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:30:37,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:30:37,867 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-07-25 13:30:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:38,880 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-25 13:30:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:30:38,880 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-07-25 13:30:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:38,880 INFO L225 Difference]: With dead ends: 257 [2018-07-25 13:30:38,881 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 13:30:38,881 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:30:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 13:30:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 13:30:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 13:30:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-25 13:30:38,887 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-25 13:30:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:38,887 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-25 13:30:38,887 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:30:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-25 13:30:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 13:30:38,888 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:38,888 INFO L354 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-25 13:30:38,889 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash 670635161, now seen corresponding path program 125 times [2018-07-25 13:30:38,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:39,759 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:39,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:30:39,760 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:30:39,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:30:39,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:30:39,761 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-07-25 13:30:40,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:40,798 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-25 13:30:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:30:40,799 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-25 13:30:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:40,799 INFO L225 Difference]: With dead ends: 259 [2018-07-25 13:30:40,799 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 13:30:40,800 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:30:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 13:30:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 13:30:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 13:30:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-25 13:30:40,807 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-25 13:30:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:40,807 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-25 13:30:40,807 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:30:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-25 13:30:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 13:30:40,808 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:40,808 INFO L354 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-25 13:30:40,809 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash 235347411, now seen corresponding path program 126 times [2018-07-25 13:30:40,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:41,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:41,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:30:41,797 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:30:41,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:30:41,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:30:41,798 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-07-25 13:30:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:42,848 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-25 13:30:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:30:42,848 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-07-25 13:30:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:42,849 INFO L225 Difference]: With dead ends: 261 [2018-07-25 13:30:42,849 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 13:30:42,850 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:30:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 13:30:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 13:30:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 13:30:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-25 13:30:42,856 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-25 13:30:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:42,856 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-25 13:30:42,856 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:30:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-25 13:30:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 13:30:42,857 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:42,857 INFO L354 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-25 13:30:42,858 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:42,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1464352627, now seen corresponding path program 127 times [2018-07-25 13:30:42,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:43,785 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:43,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:30:43,785 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:30:43,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:30:43,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:30:43,787 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-07-25 13:30:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:44,821 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-25 13:30:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:30:44,821 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-25 13:30:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:44,822 INFO L225 Difference]: With dead ends: 263 [2018-07-25 13:30:44,822 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 13:30:44,823 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:30:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 13:30:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 13:30:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 13:30:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-25 13:30:44,830 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-25 13:30:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:44,830 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-25 13:30:44,830 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:30:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-25 13:30:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 13:30:44,831 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:44,831 INFO L354 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-25 13:30:44,831 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1506450631, now seen corresponding path program 128 times [2018-07-25 13:30:44,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:45,742 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:45,742 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:30:45,743 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:30:45,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:30:45,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:30:45,744 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-07-25 13:30:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:46,831 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-25 13:30:46,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:30:46,832 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-07-25 13:30:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:46,832 INFO L225 Difference]: With dead ends: 265 [2018-07-25 13:30:46,832 INFO L226 Difference]: Without dead ends: 263 [2018-07-25 13:30:46,834 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:30:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-25 13:30:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-25 13:30:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-25 13:30:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-25 13:30:46,840 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-25 13:30:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:46,841 INFO L472 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-25 13:30:46,841 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:30:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-25 13:30:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-25 13:30:46,841 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,842 INFO L354 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-25 13:30:46,842 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,842 INFO L82 PathProgramCache]: Analyzing trace with hash 295129729, now seen corresponding path program 129 times [2018-07-25 13:30:46,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:30:47,810 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:30:47,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:30:47,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:30:47,811 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-07-25 13:30:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,877 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-25 13:30:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:30:48,877 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-25 13:30:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,878 INFO L225 Difference]: With dead ends: 267 [2018-07-25 13:30:48,878 INFO L226 Difference]: Without dead ends: 265 [2018-07-25 13:30:48,879 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:30:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-25 13:30:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-25 13:30:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-25 13:30:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-25 13:30:48,884 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-25 13:30:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,885 INFO L472 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-25 13:30:48,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:30:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-25 13:30:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-25 13:30:48,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,886 INFO L354 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-25 13:30:48,886 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash 151880123, now seen corresponding path program 130 times [2018-07-25 13:30:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:30:49,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:30:49,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:30:49,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:30:49,841 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-07-25 13:30:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:50,953 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-25 13:30:50,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:30:50,953 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-07-25 13:30:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:50,954 INFO L225 Difference]: With dead ends: 269 [2018-07-25 13:30:50,954 INFO L226 Difference]: Without dead ends: 267 [2018-07-25 13:30:50,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:30:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-25 13:30:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-25 13:30:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:30:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-25 13:30:50,961 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-25 13:30:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:50,961 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-25 13:30:50,961 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:30:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-25 13:30:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-25 13:30:50,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:50,962 INFO L354 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-25 13:30:50,962 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:50,962 INFO L82 PathProgramCache]: Analyzing trace with hash -72037771, now seen corresponding path program 131 times [2018-07-25 13:30:50,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:51,920 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:51,920 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:30:51,921 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:30:51,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:30:51,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:30:51,922 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-07-25 13:30:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:53,062 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-25 13:30:53,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:30:53,062 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-25 13:30:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:53,063 INFO L225 Difference]: With dead ends: 271 [2018-07-25 13:30:53,063 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:30:53,064 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:30:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:30:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-25 13:30:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-25 13:30:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-25 13:30:53,070 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-07-25 13:30:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:53,070 INFO L472 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-25 13:30:53,070 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:30:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-25 13:30:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-25 13:30:53,071 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:53,071 INFO L354 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-07-25 13:30:53,071 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash -508769105, now seen corresponding path program 132 times [2018-07-25 13:30:53,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:54,078 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:54,078 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:30:54,079 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:30:54,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:30:54,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:30:54,080 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-07-25 13:30:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:55,240 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-25 13:30:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:30:55,240 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-07-25 13:30:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:55,241 INFO L225 Difference]: With dead ends: 273 [2018-07-25 13:30:55,241 INFO L226 Difference]: Without dead ends: 271 [2018-07-25 13:30:55,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:30:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-25 13:30:55,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-25 13:30:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 13:30:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-25 13:30:55,248 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-07-25 13:30:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:55,248 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-25 13:30:55,248 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:30:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-25 13:30:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 13:30:55,249 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:55,249 INFO L354 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-07-25 13:30:55,249 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash 699213929, now seen corresponding path program 133 times [2018-07-25 13:30:55,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:56,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:56,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:30:56,254 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:30:56,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:30:56,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:30:56,255 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-07-25 13:30:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:57,434 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-25 13:30:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:30:57,434 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-25 13:30:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:57,435 INFO L225 Difference]: With dead ends: 275 [2018-07-25 13:30:57,435 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 13:30:57,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:30:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 13:30:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-25 13:30:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-25 13:30:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-25 13:30:57,442 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-07-25 13:30:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:57,442 INFO L472 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-25 13:30:57,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:30:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-25 13:30:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-25 13:30:57,443 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:57,443 INFO L354 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-07-25 13:30:57,443 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1929739683, now seen corresponding path program 134 times [2018-07-25 13:30:57,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:58,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:58,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:30:58,595 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:30:58,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:30:58,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:30:58,596 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-07-25 13:30:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:59,756 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-25 13:30:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:30:59,756 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-07-25 13:30:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:59,757 INFO L225 Difference]: With dead ends: 277 [2018-07-25 13:30:59,757 INFO L226 Difference]: Without dead ends: 275 [2018-07-25 13:30:59,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:30:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-25 13:30:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-25 13:30:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-25 13:30:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-25 13:30:59,768 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-07-25 13:30:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:59,769 INFO L472 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-25 13:30:59,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:30:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-25 13:30:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-25 13:30:59,770 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:59,770 INFO L354 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-07-25 13:30:59,770 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:59,771 INFO L82 PathProgramCache]: Analyzing trace with hash -945984419, now seen corresponding path program 135 times [2018-07-25 13:30:59,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:00,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:00,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:31:00,956 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:31:00,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:31:00,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:31:00,957 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-07-25 13:31:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:02,178 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-25 13:31:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:31:02,179 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-25 13:31:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:02,179 INFO L225 Difference]: With dead ends: 279 [2018-07-25 13:31:02,179 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 13:31:02,198 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:31:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 13:31:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-25 13:31:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-25 13:31:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-25 13:31:02,206 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-07-25 13:31:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:02,207 INFO L472 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-25 13:31:02,207 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:31:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-25 13:31:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-25 13:31:02,207 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:02,208 INFO L354 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-07-25 13:31:02,208 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:02,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1442092183, now seen corresponding path program 136 times [2018-07-25 13:31:02,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:03,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:03,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:31:03,290 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:31:03,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:31:03,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:31:03,291 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. [2018-07-25 13:31:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:04,524 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-07-25 13:31:04,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:31:04,524 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 276 [2018-07-25 13:31:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:04,525 INFO L225 Difference]: With dead ends: 281 [2018-07-25 13:31:04,525 INFO L226 Difference]: Without dead ends: 279 [2018-07-25 13:31:04,526 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:31:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-25 13:31:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-07-25 13:31:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 13:31:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-07-25 13:31:04,533 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-07-25 13:31:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:04,534 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-07-25 13:31:04,534 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:31:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-07-25 13:31:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-25 13:31:04,535 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:04,535 INFO L354 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-07-25 13:31:04,535 INFO L415 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:04,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1423796655, now seen corresponding path program 137 times [2018-07-25 13:31:04,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:05,646 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:05,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:31:05,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:31:05,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:31:05,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:31:05,647 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 140 states. [2018-07-25 13:31:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:06,864 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-25 13:31:06,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:31:06,865 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-07-25 13:31:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:06,866 INFO L225 Difference]: With dead ends: 283 [2018-07-25 13:31:06,866 INFO L226 Difference]: Without dead ends: 281 [2018-07-25 13:31:06,866 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:31:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-25 13:31:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-25 13:31:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 13:31:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-25 13:31:06,873 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-07-25 13:31:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:06,873 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-25 13:31:06,873 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:31:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-25 13:31:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-25 13:31:06,874 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:06,874 INFO L354 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-07-25 13:31:06,874 INFO L415 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1826034059, now seen corresponding path program 138 times [2018-07-25 13:31:06,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:07,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:07,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:31:07,961 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:31:07,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:31:07,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:31:07,963 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 141 states. [2018-07-25 13:31:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:09,229 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-25 13:31:09,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:31:09,230 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 280 [2018-07-25 13:31:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:09,230 INFO L225 Difference]: With dead ends: 285 [2018-07-25 13:31:09,230 INFO L226 Difference]: Without dead ends: 283 [2018-07-25 13:31:09,231 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:31:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-25 13:31:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-07-25 13:31:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-07-25 13:31:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-07-25 13:31:09,238 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-07-25 13:31:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:09,238 INFO L472 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-07-25 13:31:09,238 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:31:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-07-25 13:31:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-07-25 13:31:09,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:09,239 INFO L354 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-07-25 13:31:09,239 INFO L415 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1822841275, now seen corresponding path program 139 times [2018-07-25 13:31:09,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:10,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:10,329 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:31:10,329 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:31:10,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:31:10,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:31:10,330 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 142 states. [2018-07-25 13:31:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:11,612 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-25 13:31:11,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:31:11,612 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-07-25 13:31:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:11,613 INFO L225 Difference]: With dead ends: 287 [2018-07-25 13:31:11,613 INFO L226 Difference]: Without dead ends: 285 [2018-07-25 13:31:11,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:31:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-07-25 13:31:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-07-25 13:31:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-25 13:31:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-07-25 13:31:11,620 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-07-25 13:31:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:11,620 INFO L472 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-07-25 13:31:11,620 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:31:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-07-25 13:31:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-25 13:31:11,621 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:11,621 INFO L354 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-07-25 13:31:11,621 INFO L415 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash 596243583, now seen corresponding path program 140 times [2018-07-25 13:31:11,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:12,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:12,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:31:12,805 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:31:12,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:31:12,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:31:12,806 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 143 states. [2018-07-25 13:31:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:14,073 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-07-25 13:31:14,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:31:14,073 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 284 [2018-07-25 13:31:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:14,074 INFO L225 Difference]: With dead ends: 289 [2018-07-25 13:31:14,074 INFO L226 Difference]: Without dead ends: 287 [2018-07-25 13:31:14,075 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:31:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-25 13:31:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-25 13:31:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-25 13:31:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-07-25 13:31:14,083 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-07-25 13:31:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:14,083 INFO L472 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-07-25 13:31:14,083 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:31:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-07-25 13:31:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-25 13:31:14,084 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:14,084 INFO L354 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-07-25 13:31:14,084 INFO L415 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1759484985, now seen corresponding path program 141 times [2018-07-25 13:31:14,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:15,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:15,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:31:15,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:31:15,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:31:15,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:31:15,246 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 144 states. [2018-07-25 13:31:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:16,608 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-25 13:31:16,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:31:16,608 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-07-25 13:31:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:16,609 INFO L225 Difference]: With dead ends: 291 [2018-07-25 13:31:16,609 INFO L226 Difference]: Without dead ends: 289 [2018-07-25 13:31:16,609 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:31:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-25 13:31:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-07-25 13:31:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-25 13:31:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-07-25 13:31:16,616 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-07-25 13:31:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:16,616 INFO L472 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-07-25 13:31:16,616 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:31:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-07-25 13:31:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-25 13:31:16,617 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:16,617 INFO L354 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1] [2018-07-25 13:31:16,617 INFO L415 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1351991949, now seen corresponding path program 142 times [2018-07-25 13:31:16,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:17,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:17,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:31:17,772 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:31:17,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:31:17,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:31:17,773 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 145 states. [2018-07-25 13:31:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:19,113 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-07-25 13:31:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:31:19,113 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 288 [2018-07-25 13:31:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:19,114 INFO L225 Difference]: With dead ends: 293 [2018-07-25 13:31:19,114 INFO L226 Difference]: Without dead ends: 291 [2018-07-25 13:31:19,115 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:31:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-07-25 13:31:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-07-25 13:31:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-25 13:31:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-07-25 13:31:19,121 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-07-25 13:31:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:19,121 INFO L472 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-07-25 13:31:19,121 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:31:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-07-25 13:31:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-25 13:31:19,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:19,122 INFO L354 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1] [2018-07-25 13:31:19,122 INFO L415 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2110879789, now seen corresponding path program 143 times [2018-07-25 13:31:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:20,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:20,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:31:20,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:31:20,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:31:20,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:31:20,324 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 146 states. [2018-07-25 13:31:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:21,670 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-25 13:31:21,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:31:21,670 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-07-25 13:31:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:21,671 INFO L225 Difference]: With dead ends: 295 [2018-07-25 13:31:21,671 INFO L226 Difference]: Without dead ends: 293 [2018-07-25 13:31:21,671 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:31:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-25 13:31:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-07-25 13:31:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-25 13:31:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-07-25 13:31:21,678 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-07-25 13:31:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:21,678 INFO L472 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-07-25 13:31:21,678 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:31:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-07-25 13:31:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-25 13:31:21,679 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:21,679 INFO L354 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1] [2018-07-25 13:31:21,679 INFO L415 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:21,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1330965607, now seen corresponding path program 144 times [2018-07-25 13:31:21,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:22,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:22,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:31:22,916 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:31:22,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:31:22,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:31:22,917 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 147 states. [2018-07-25 13:31:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:24,301 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-07-25 13:31:24,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:31:24,301 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 292 [2018-07-25 13:31:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:24,302 INFO L225 Difference]: With dead ends: 297 [2018-07-25 13:31:24,302 INFO L226 Difference]: Without dead ends: 295 [2018-07-25 13:31:24,302 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:31:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-25 13:31:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-07-25 13:31:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-07-25 13:31:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-07-25 13:31:24,309 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-07-25 13:31:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:24,310 INFO L472 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-07-25 13:31:24,310 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:31:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-07-25 13:31:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-07-25 13:31:24,310 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:24,311 INFO L354 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1] [2018-07-25 13:31:24,311 INFO L415 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -842253791, now seen corresponding path program 145 times [2018-07-25 13:31:24,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:25,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:25,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:31:25,514 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:31:25,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:31:25,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:31:25,515 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 148 states. [2018-07-25 13:31:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:26,917 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-07-25 13:31:26,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:31:26,917 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-07-25 13:31:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:26,918 INFO L225 Difference]: With dead ends: 299 [2018-07-25 13:31:26,918 INFO L226 Difference]: Without dead ends: 297 [2018-07-25 13:31:26,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:31:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-25 13:31:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-07-25 13:31:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-25 13:31:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-07-25 13:31:26,925 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-07-25 13:31:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:26,925 INFO L472 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-07-25 13:31:26,925 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:31:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-07-25 13:31:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-25 13:31:26,926 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:26,926 INFO L354 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1] [2018-07-25 13:31:26,926 INFO L415 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1951989413, now seen corresponding path program 146 times [2018-07-25 13:31:26,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:28,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:28,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:31:28,161 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:31:28,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:31:28,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:31:28,162 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 149 states. [2018-07-25 13:31:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:29,585 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-07-25 13:31:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:31:29,585 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 296 [2018-07-25 13:31:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:29,586 INFO L225 Difference]: With dead ends: 301 [2018-07-25 13:31:29,586 INFO L226 Difference]: Without dead ends: 299 [2018-07-25 13:31:29,587 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:31:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-25 13:31:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-07-25 13:31:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-07-25 13:31:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-07-25 13:31:29,599 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-07-25 13:31:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:29,599 INFO L472 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-07-25 13:31:29,599 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:31:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-07-25 13:31:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-07-25 13:31:29,600 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:29,600 INFO L354 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1] [2018-07-25 13:31:29,601 INFO L415 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1038934549, now seen corresponding path program 147 times [2018-07-25 13:31:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:31,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:31,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:31:31,045 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:31:31,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:31:31,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:31:31,046 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 150 states. [2018-07-25 13:31:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:32,464 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-25 13:31:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:31:32,464 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-07-25 13:31:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:32,465 INFO L225 Difference]: With dead ends: 303 [2018-07-25 13:31:32,465 INFO L226 Difference]: Without dead ends: 301 [2018-07-25 13:31:32,466 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:31:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-07-25 13:31:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-07-25 13:31:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-25 13:31:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-07-25 13:31:32,472 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-07-25 13:31:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:32,472 INFO L472 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-07-25 13:31:32,473 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:31:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-07-25 13:31:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-25 13:31:32,474 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:32,474 INFO L354 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1] [2018-07-25 13:31:32,474 INFO L415 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1983741007, now seen corresponding path program 148 times [2018-07-25 13:31:32,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:33,761 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:33,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:31:33,762 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:31:33,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:31:33,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:31:33,763 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 151 states. [2018-07-25 13:31:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:35,231 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-07-25 13:31:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:31:35,232 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 300 [2018-07-25 13:31:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:35,232 INFO L225 Difference]: With dead ends: 305 [2018-07-25 13:31:35,232 INFO L226 Difference]: Without dead ends: 303 [2018-07-25 13:31:35,233 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:31:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-07-25 13:31:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-07-25 13:31:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-07-25 13:31:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-07-25 13:31:35,239 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-07-25 13:31:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:35,240 INFO L472 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-07-25 13:31:35,240 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:31:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-07-25 13:31:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-07-25 13:31:35,240 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:35,241 INFO L354 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1] [2018-07-25 13:31:35,241 INFO L415 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:35,241 INFO L82 PathProgramCache]: Analyzing trace with hash -590319607, now seen corresponding path program 149 times [2018-07-25 13:31:35,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:36,545 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:36,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:31:36,545 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:31:36,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:31:36,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:31:36,547 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 152 states. [2018-07-25 13:31:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:38,028 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-25 13:31:38,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:31:38,028 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-07-25 13:31:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:38,029 INFO L225 Difference]: With dead ends: 307 [2018-07-25 13:31:38,029 INFO L226 Difference]: Without dead ends: 305 [2018-07-25 13:31:38,030 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:31:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-25 13:31:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-07-25 13:31:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-25 13:31:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-07-25 13:31:38,036 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-07-25 13:31:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:38,037 INFO L472 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-07-25 13:31:38,037 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:31:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-07-25 13:31:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-25 13:31:38,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:38,038 INFO L354 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1] [2018-07-25 13:31:38,038 INFO L415 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:38,038 INFO L82 PathProgramCache]: Analyzing trace with hash -361407165, now seen corresponding path program 150 times [2018-07-25 13:31:38,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:39,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:39,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 13:31:39,327 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:31:39,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:31:39,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:31:39,328 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 153 states. [2018-07-25 13:31:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:40,831 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-07-25 13:31:40,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:31:40,832 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 304 [2018-07-25 13:31:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:40,832 INFO L225 Difference]: With dead ends: 309 [2018-07-25 13:31:40,832 INFO L226 Difference]: Without dead ends: 307 [2018-07-25 13:31:40,833 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:31:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-07-25 13:31:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-07-25 13:31:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-07-25 13:31:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-07-25 13:31:40,840 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2018-07-25 13:31:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:40,840 INFO L472 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-07-25 13:31:40,840 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 13:31:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-07-25 13:31:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-07-25 13:31:40,841 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:40,841 INFO L354 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1] [2018-07-25 13:31:40,841 INFO L415 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash 580117501, now seen corresponding path program 151 times [2018-07-25 13:31:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:42,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:42,200 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:31:42,200 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:31:42,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:31:42,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:31:42,201 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 154 states. [2018-07-25 13:31:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:43,708 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-07-25 13:31:43,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:31:43,708 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-07-25 13:31:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:43,709 INFO L225 Difference]: With dead ends: 311 [2018-07-25 13:31:43,709 INFO L226 Difference]: Without dead ends: 309 [2018-07-25 13:31:43,711 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:31:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-25 13:31:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-07-25 13:31:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-25 13:31:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-07-25 13:31:43,723 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2018-07-25 13:31:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:43,723 INFO L472 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-07-25 13:31:43,723 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 13:31:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-07-25 13:31:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-25 13:31:43,724 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:43,724 INFO L354 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1] [2018-07-25 13:31:43,725 INFO L415 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash -852777929, now seen corresponding path program 152 times [2018-07-25 13:31:43,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:45,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:45,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 13:31:45,293 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 13:31:45,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 13:31:45,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:31:45,294 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 155 states. [2018-07-25 13:31:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:46,797 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-07-25 13:31:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:31:46,798 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 308 [2018-07-25 13:31:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:46,799 INFO L225 Difference]: With dead ends: 313 [2018-07-25 13:31:46,799 INFO L226 Difference]: Without dead ends: 311 [2018-07-25 13:31:46,800 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:31:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-25 13:31:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-07-25 13:31:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-07-25 13:31:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-07-25 13:31:46,810 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2018-07-25 13:31:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:46,810 INFO L472 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-07-25 13:31:46,810 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 13:31:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-07-25 13:31:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-07-25 13:31:46,811 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:46,811 INFO L354 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1] [2018-07-25 13:31:46,811 INFO L415 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash 819215857, now seen corresponding path program 153 times [2018-07-25 13:31:46,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:48,183 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:48,183 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 13:31:48,184 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 13:31:48,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 13:31:48,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:31:48,185 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 156 states. [2018-07-25 13:31:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:49,747 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-25 13:31:49,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 13:31:49,747 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-07-25 13:31:49,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:49,748 INFO L225 Difference]: With dead ends: 315 [2018-07-25 13:31:49,748 INFO L226 Difference]: Without dead ends: 313 [2018-07-25 13:31:49,748 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:31:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-07-25 13:31:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-07-25 13:31:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-07-25 13:31:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-07-25 13:31:49,755 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2018-07-25 13:31:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:49,755 INFO L472 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-07-25 13:31:49,755 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 13:31:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-07-25 13:31:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-25 13:31:49,756 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:49,756 INFO L354 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1] [2018-07-25 13:31:49,756 INFO L415 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:49,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1287475499, now seen corresponding path program 154 times [2018-07-25 13:31:49,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:51,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:51,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 13:31:51,167 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 13:31:51,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 13:31:51,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:31:51,168 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 157 states. [2018-07-25 13:31:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:52,794 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-07-25 13:31:52,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:31:52,794 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 312 [2018-07-25 13:31:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:52,794 INFO L225 Difference]: With dead ends: 317 [2018-07-25 13:31:52,794 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 13:31:52,795 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:31:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 13:31:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-07-25 13:31:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-07-25 13:31:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-07-25 13:31:52,806 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2018-07-25 13:31:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:52,807 INFO L472 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-07-25 13:31:52,807 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 13:31:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-07-25 13:31:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-07-25 13:31:52,808 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:52,808 INFO L354 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1] [2018-07-25 13:31:52,809 INFO L415 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 313425381, now seen corresponding path program 155 times [2018-07-25 13:31:52,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:54,462 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:54,462 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 13:31:54,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 13:31:54,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 13:31:54,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:31:54,463 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 158 states. [2018-07-25 13:31:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:56,083 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-07-25 13:31:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:31:56,083 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 314 [2018-07-25 13:31:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:56,084 INFO L225 Difference]: With dead ends: 319 [2018-07-25 13:31:56,084 INFO L226 Difference]: Without dead ends: 317 [2018-07-25 13:31:56,085 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:31:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-25 13:31:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-07-25 13:31:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-07-25 13:31:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-07-25 13:31:56,092 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2018-07-25 13:31:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:56,092 INFO L472 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-07-25 13:31:56,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 13:31:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-07-25 13:31:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-07-25 13:31:56,093 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:56,093 INFO L354 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1] [2018-07-25 13:31:56,094 INFO L415 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash 554132511, now seen corresponding path program 156 times [2018-07-25 13:31:56,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:57,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:57,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 13:31:57,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 13:31:57,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 13:31:57,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:31:57,573 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 159 states. [2018-07-25 13:31:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:59,208 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-07-25 13:31:59,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 13:31:59,209 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 316 [2018-07-25 13:31:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:59,209 INFO L225 Difference]: With dead ends: 321 [2018-07-25 13:31:59,209 INFO L226 Difference]: Without dead ends: 319 [2018-07-25 13:31:59,211 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:31:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-07-25 13:31:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-07-25 13:31:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-07-25 13:31:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-07-25 13:31:59,217 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2018-07-25 13:31:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:59,218 INFO L472 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-07-25 13:31:59,218 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 13:31:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-07-25 13:31:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-07-25 13:31:59,219 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:59,219 INFO L354 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1] [2018-07-25 13:31:59,219 INFO L415 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash -54549543, now seen corresponding path program 157 times [2018-07-25 13:31:59,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:00,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:00,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 13:32:00,775 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 13:32:00,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 13:32:00,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:32:00,776 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 160 states. [2018-07-25 13:32:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:02,403 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-07-25 13:32:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:32:02,403 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 318 [2018-07-25 13:32:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:02,404 INFO L225 Difference]: With dead ends: 323 [2018-07-25 13:32:02,404 INFO L226 Difference]: Without dead ends: 321 [2018-07-25 13:32:02,405 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:32:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-07-25 13:32:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-07-25 13:32:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-25 13:32:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-07-25 13:32:02,412 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2018-07-25 13:32:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:02,412 INFO L472 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-07-25 13:32:02,412 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 13:32:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-07-25 13:32:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-25 13:32:02,413 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:02,413 INFO L354 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1] [2018-07-25 13:32:02,413 INFO L415 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:02,413 INFO L82 PathProgramCache]: Analyzing trace with hash -882451181, now seen corresponding path program 158 times [2018-07-25 13:32:02,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:03,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:03,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 13:32:03,976 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 13:32:03,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 13:32:03,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:32:03,977 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 161 states. [2018-07-25 13:32:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:05,613 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-07-25 13:32:05,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 13:32:05,613 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 320 [2018-07-25 13:32:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:05,614 INFO L225 Difference]: With dead ends: 325 [2018-07-25 13:32:05,614 INFO L226 Difference]: Without dead ends: 323 [2018-07-25 13:32:05,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:32:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-07-25 13:32:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-07-25 13:32:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-07-25 13:32:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-07-25 13:32:05,621 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2018-07-25 13:32:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:05,621 INFO L472 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-07-25 13:32:05,622 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 13:32:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-07-25 13:32:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-07-25 13:32:05,622 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:05,622 INFO L354 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1] [2018-07-25 13:32:05,623 INFO L415 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1926975539, now seen corresponding path program 159 times [2018-07-25 13:32:05,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:07,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:07,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 13:32:07,189 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 13:32:07,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 13:32:07,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:32:07,190 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 162 states. [2018-07-25 13:32:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:08,848 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-07-25 13:32:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:32:08,848 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 322 [2018-07-25 13:32:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:08,849 INFO L225 Difference]: With dead ends: 327 [2018-07-25 13:32:08,849 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 13:32:08,850 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:32:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 13:32:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-07-25 13:32:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-07-25 13:32:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-07-25 13:32:08,856 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2018-07-25 13:32:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:08,857 INFO L472 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-07-25 13:32:08,857 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 13:32:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-07-25 13:32:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-25 13:32:08,858 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:08,858 INFO L354 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1] [2018-07-25 13:32:08,858 INFO L415 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:08,858 INFO L82 PathProgramCache]: Analyzing trace with hash -692536313, now seen corresponding path program 160 times [2018-07-25 13:32:08,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:10,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:10,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 13:32:10,430 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 13:32:10,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 13:32:10,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:32:10,431 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 163 states. [2018-07-25 13:32:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:12,145 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-07-25 13:32:12,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 13:32:12,146 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 324 [2018-07-25 13:32:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:12,146 INFO L225 Difference]: With dead ends: 329 [2018-07-25 13:32:12,147 INFO L226 Difference]: Without dead ends: 327 [2018-07-25 13:32:12,147 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:32:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-07-25 13:32:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-07-25 13:32:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-07-25 13:32:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-07-25 13:32:12,155 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2018-07-25 13:32:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:12,155 INFO L472 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-07-25 13:32:12,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 13:32:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-07-25 13:32:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-07-25 13:32:12,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:12,156 INFO L354 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1] [2018-07-25 13:32:12,156 INFO L415 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash 192586177, now seen corresponding path program 161 times [2018-07-25 13:32:12,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:13,769 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:13,769 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 13:32:13,769 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 13:32:13,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 13:32:13,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:32:13,770 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 164 states. [2018-07-25 13:32:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:15,529 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-07-25 13:32:15,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:32:15,529 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 326 [2018-07-25 13:32:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:15,529 INFO L225 Difference]: With dead ends: 331 [2018-07-25 13:32:15,529 INFO L226 Difference]: Without dead ends: 329 [2018-07-25 13:32:15,530 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:32:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-25 13:32:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-07-25 13:32:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-07-25 13:32:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-07-25 13:32:15,537 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2018-07-25 13:32:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:15,537 INFO L472 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-07-25 13:32:15,537 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 13:32:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-07-25 13:32:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-07-25 13:32:15,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:15,538 INFO L354 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1] [2018-07-25 13:32:15,538 INFO L415 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash 391774459, now seen corresponding path program 162 times [2018-07-25 13:32:15,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:17,161 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:17,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 13:32:17,161 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 13:32:17,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 13:32:17,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:32:17,162 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 165 states. [2018-07-25 13:32:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:18,949 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-07-25 13:32:18,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:32:18,949 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 328 [2018-07-25 13:32:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:18,950 INFO L225 Difference]: With dead ends: 333 [2018-07-25 13:32:18,950 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 13:32:18,950 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:32:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 13:32:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-07-25 13:32:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-07-25 13:32:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-07-25 13:32:18,958 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2018-07-25 13:32:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:18,959 INFO L472 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-07-25 13:32:18,959 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 13:32:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-07-25 13:32:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-07-25 13:32:18,960 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:18,960 INFO L354 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1] [2018-07-25 13:32:18,960 INFO L415 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1461814859, now seen corresponding path program 163 times [2018-07-25 13:32:18,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:20,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:20,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 13:32:20,621 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 13:32:20,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 13:32:20,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:32:20,622 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 166 states. [2018-07-25 13:32:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:22,454 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-07-25 13:32:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 13:32:22,455 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 330 [2018-07-25 13:32:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:22,455 INFO L225 Difference]: With dead ends: 335 [2018-07-25 13:32:22,455 INFO L226 Difference]: Without dead ends: 333 [2018-07-25 13:32:22,456 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:32:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-25 13:32:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-07-25 13:32:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-07-25 13:32:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-07-25 13:32:22,468 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2018-07-25 13:32:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:22,468 INFO L472 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-07-25 13:32:22,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 13:32:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-07-25 13:32:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-07-25 13:32:22,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:22,470 INFO L354 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1] [2018-07-25 13:32:22,470 INFO L415 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:22,471 INFO L82 PathProgramCache]: Analyzing trace with hash -349721617, now seen corresponding path program 164 times [2018-07-25 13:32:22,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:24,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:24,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 13:32:24,433 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 13:32:24,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 13:32:24,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:32:24,435 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 167 states. [2018-07-25 13:32:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:26,256 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-07-25 13:32:26,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:32:26,256 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 332 [2018-07-25 13:32:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:26,256 INFO L225 Difference]: With dead ends: 337 [2018-07-25 13:32:26,256 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 13:32:26,258 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:32:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 13:32:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-07-25 13:32:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-07-25 13:32:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-07-25 13:32:26,265 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2018-07-25 13:32:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:26,265 INFO L472 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-07-25 13:32:26,265 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 13:32:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-07-25 13:32:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-07-25 13:32:26,266 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:26,266 INFO L354 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1] [2018-07-25 13:32:26,266 INFO L415 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:26,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1074972759, now seen corresponding path program 165 times [2018-07-25 13:32:26,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:27,919 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:27,919 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 13:32:27,919 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 13:32:27,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 13:32:27,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:32:27,921 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 168 states. [2018-07-25 13:32:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:29,763 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-07-25 13:32:29,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 13:32:29,763 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 334 [2018-07-25 13:32:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:29,764 INFO L225 Difference]: With dead ends: 339 [2018-07-25 13:32:29,764 INFO L226 Difference]: Without dead ends: 337 [2018-07-25 13:32:29,765 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:32:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-07-25 13:32:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-07-25 13:32:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-25 13:32:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-07-25 13:32:29,773 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2018-07-25 13:32:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:29,773 INFO L472 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-07-25 13:32:29,773 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 13:32:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-07-25 13:32:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-07-25 13:32:29,774 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:29,774 INFO L354 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1] [2018-07-25 13:32:29,774 INFO L415 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2038349027, now seen corresponding path program 166 times [2018-07-25 13:32:29,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:31,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:31,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 13:32:31,446 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 13:32:31,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 13:32:31,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:32:31,447 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 169 states. [2018-07-25 13:32:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:33,305 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-07-25 13:32:33,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:32:33,306 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 336 [2018-07-25 13:32:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:33,306 INFO L225 Difference]: With dead ends: 341 [2018-07-25 13:32:33,306 INFO L226 Difference]: Without dead ends: 339 [2018-07-25 13:32:33,307 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:32:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-07-25 13:32:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-07-25 13:32:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 13:32:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-07-25 13:32:33,315 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2018-07-25 13:32:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:33,315 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-07-25 13:32:33,315 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 13:32:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-07-25 13:32:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-07-25 13:32:33,316 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:33,316 INFO L354 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1] [2018-07-25 13:32:33,316 INFO L415 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 348380061, now seen corresponding path program 167 times [2018-07-25 13:32:33,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:35,262 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:35,262 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 13:32:35,263 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 13:32:35,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 13:32:35,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:32:35,264 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 170 states. [2018-07-25 13:32:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:37,319 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-07-25 13:32:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 13:32:37,319 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 338 [2018-07-25 13:32:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:37,319 INFO L225 Difference]: With dead ends: 343 [2018-07-25 13:32:37,320 INFO L226 Difference]: Without dead ends: 341 [2018-07-25 13:32:37,321 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:32:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-07-25 13:32:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-07-25 13:32:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-07-25 13:32:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-07-25 13:32:37,329 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2018-07-25 13:32:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:37,330 INFO L472 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-07-25 13:32:37,330 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 13:32:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-07-25 13:32:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-25 13:32:37,331 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:37,331 INFO L354 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1] [2018-07-25 13:32:37,331 INFO L415 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:37,331 INFO L82 PathProgramCache]: Analyzing trace with hash -214158377, now seen corresponding path program 168 times [2018-07-25 13:32:37,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:39,338 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:39,338 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 13:32:39,338 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 13:32:39,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 13:32:39,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:32:39,340 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 171 states. [2018-07-25 13:32:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:41,405 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-07-25 13:32:41,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:32:41,406 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 340 [2018-07-25 13:32:41,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:41,406 INFO L225 Difference]: With dead ends: 345 [2018-07-25 13:32:41,406 INFO L226 Difference]: Without dead ends: 343 [2018-07-25 13:32:41,408 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:32:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-07-25 13:32:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-07-25 13:32:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-07-25 13:32:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-07-25 13:32:41,416 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2018-07-25 13:32:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:41,417 INFO L472 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-07-25 13:32:41,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 13:32:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-07-25 13:32:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-07-25 13:32:41,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:41,418 INFO L354 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1] [2018-07-25 13:32:41,418 INFO L415 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:41,418 INFO L82 PathProgramCache]: Analyzing trace with hash 352282001, now seen corresponding path program 169 times [2018-07-25 13:32:41,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:43,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:43,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 13:32:43,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 13:32:43,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 13:32:43,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:32:43,249 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 172 states. [2018-07-25 13:32:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:45,172 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-07-25 13:32:45,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:32:45,172 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 342 [2018-07-25 13:32:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:45,173 INFO L225 Difference]: With dead ends: 347 [2018-07-25 13:32:45,173 INFO L226 Difference]: Without dead ends: 345 [2018-07-25 13:32:45,174 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:32:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-07-25 13:32:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-07-25 13:32:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-07-25 13:32:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-07-25 13:32:45,182 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2018-07-25 13:32:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:45,182 INFO L472 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-07-25 13:32:45,182 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 13:32:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-07-25 13:32:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-07-25 13:32:45,183 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:45,183 INFO L354 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1] [2018-07-25 13:32:45,183 INFO L415 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash -759361333, now seen corresponding path program 170 times [2018-07-25 13:32:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:46,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:46,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 13:32:46,928 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 13:32:46,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 13:32:46,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:32:46,930 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 173 states. [2018-07-25 13:32:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:48,882 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-07-25 13:32:48,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 13:32:48,882 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 344 [2018-07-25 13:32:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:48,883 INFO L225 Difference]: With dead ends: 349 [2018-07-25 13:32:48,883 INFO L226 Difference]: Without dead ends: 347 [2018-07-25 13:32:48,884 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:32:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-07-25 13:32:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-07-25 13:32:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-07-25 13:32:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-07-25 13:32:48,892 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2018-07-25 13:32:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:48,893 INFO L472 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-07-25 13:32:48,893 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 13:32:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-07-25 13:32:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-07-25 13:32:48,894 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:48,894 INFO L354 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1] [2018-07-25 13:32:48,894 INFO L415 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash 398251397, now seen corresponding path program 171 times [2018-07-25 13:32:48,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:50,747 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:50,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 13:32:50,748 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 13:32:50,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 13:32:50,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:32:50,749 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 174 states. [2018-07-25 13:32:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:52,738 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-07-25 13:32:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:32:52,738 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 346 [2018-07-25 13:32:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:52,739 INFO L225 Difference]: With dead ends: 351 [2018-07-25 13:32:52,739 INFO L226 Difference]: Without dead ends: 349 [2018-07-25 13:32:52,739 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:32:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-07-25 13:32:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-07-25 13:32:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-07-25 13:32:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-07-25 13:32:52,753 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2018-07-25 13:32:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:52,753 INFO L472 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-07-25 13:32:52,753 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 13:32:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-07-25 13:32:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-07-25 13:32:52,755 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:52,755 INFO L354 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1] [2018-07-25 13:32:52,755 INFO L415 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:52,755 INFO L82 PathProgramCache]: Analyzing trace with hash 467555263, now seen corresponding path program 172 times [2018-07-25 13:32:52,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:54,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:54,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 13:32:54,817 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 13:32:54,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 13:32:54,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:32:54,819 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 175 states. [2018-07-25 13:32:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:56,801 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-07-25 13:32:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 13:32:56,801 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 348 [2018-07-25 13:32:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:56,802 INFO L225 Difference]: With dead ends: 353 [2018-07-25 13:32:56,802 INFO L226 Difference]: Without dead ends: 351 [2018-07-25 13:32:56,802 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:32:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-07-25 13:32:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-07-25 13:32:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-07-25 13:32:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-07-25 13:32:56,810 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2018-07-25 13:32:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:56,810 INFO L472 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-07-25 13:32:56,810 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 13:32:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-07-25 13:32:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-07-25 13:32:56,811 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:56,811 INFO L354 BasicCegarLoop]: trace histogram [174, 173, 1, 1, 1] [2018-07-25 13:32:56,811 INFO L415 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1650906247, now seen corresponding path program 173 times [2018-07-25 13:32:56,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:58,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:58,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 13:32:58,775 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 13:32:58,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 13:32:58,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:32:58,777 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 176 states. [2018-07-25 13:33:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:00,775 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-07-25 13:33:00,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:33:00,776 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 350 [2018-07-25 13:33:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:00,777 INFO L225 Difference]: With dead ends: 355 [2018-07-25 13:33:00,777 INFO L226 Difference]: Without dead ends: 353 [2018-07-25 13:33:00,778 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:33:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-07-25 13:33:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-07-25 13:33:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-07-25 13:33:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-07-25 13:33:00,787 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2018-07-25 13:33:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:00,787 INFO L472 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-07-25 13:33:00,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 13:33:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-07-25 13:33:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-07-25 13:33:00,788 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:00,788 INFO L354 BasicCegarLoop]: trace histogram [175, 174, 1, 1, 1] [2018-07-25 13:33:00,788 INFO L415 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1677919053, now seen corresponding path program 174 times [2018-07-25 13:33:00,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:02,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:02,812 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 13:33:02,812 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 13:33:02,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 13:33:02,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:33:02,813 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 177 states. [2018-07-25 13:33:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:04,807 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-07-25 13:33:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 13:33:04,807 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 352 [2018-07-25 13:33:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:04,808 INFO L225 Difference]: With dead ends: 357 [2018-07-25 13:33:04,808 INFO L226 Difference]: Without dead ends: 355 [2018-07-25 13:33:04,809 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:33:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-07-25 13:33:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-07-25 13:33:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-07-25 13:33:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-07-25 13:33:04,816 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2018-07-25 13:33:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:04,816 INFO L472 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-07-25 13:33:04,816 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 13:33:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-07-25 13:33:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-07-25 13:33:04,817 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:04,817 INFO L354 BasicCegarLoop]: trace histogram [176, 175, 1, 1, 1] [2018-07-25 13:33:04,818 INFO L415 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1867421843, now seen corresponding path program 175 times [2018-07-25 13:33:04,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:06,929 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:06,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 13:33:06,929 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 13:33:06,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 13:33:06,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:33:06,931 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 178 states. Received shutdown request... [2018-07-25 13:33:08,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:33:08,066 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:33:08,075 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:33:08,076 INFO L202 PluginConnector]: Adding new model phases1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:33:08 BoogieIcfgContainer [2018-07-25 13:33:08,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:33:08,077 INFO L168 Benchmark]: Toolchain (without parser) took 252446.98 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 968.6 MB in the end (delta: 485.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-07-25 13:33:08,079 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 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:33:08,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.02 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:33:08,080 INFO L168 Benchmark]: Boogie Preprocessor took 21.88 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:33:08,080 INFO L168 Benchmark]: RCFGBuilder took 251.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:33:08,081 INFO L168 Benchmark]: TraceAbstraction took 252129.29 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 968.6 MB in the end (delta: 474.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-07-25 13:33:08,088 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.17 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 40.02 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 21.88 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 251.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252129.29 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 968.6 MB in the end (delta: 474.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (355states) and interpolant automaton (currently 101 states, 178 states before enhancement), while ReachableStatesComputation was computing reachable states (197 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 252.0s OverallTime, 176 OverallIterations, 176 TraceHistogramMax, 129.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16024 SDtfs, 0 SDslu, 1818951 SDs, 0 SdLazy, 1849985 SolverSat, 0 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 87.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15752 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15576 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=175, 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: 1.2s AutomataMinimizationTime, 175 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 22.9s SatisfiabilityAnalysisTime, 87.9s InterpolantComputationTime, 31504 NumberOfCodeBlocks, 31504 NumberOfCodeBlocksAsserted, 176 NumberOfCheckSat, 31328 ConstructedInterpolants, 0 QuantifiedInterpolants, 51567120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 176 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1817200 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/phases1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-33-08-107.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/phases1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-33-08-107.csv Completed graceful shutdown